Big Data Analytics | Tutorial #30 | Clique Percolation Method CPM ( Solved Problem)
Вставка
- Опубліковано 18 лис 2024
- A clique percolation method is a popular approach for analyzing the overlapping community structure of networks. #BigData #CPM
Follow me on Instagram 👉 / ngnieredteacher
Visit my Profile 👉 / reng99
Support my work on Patreon 👉 / ranjiraj
2 things.
1. In the original graph, there was a 4-clique available. WHy did u ignore it?
2. U should have connected d & f and c & e as well. Isn't it?
1. the input of the algorithm is an integer k (in that case 3) and the graph. That means that you are only searching for 3-cliques.
2. And yes, c, d, e, f should be a clique.
i like the speed with which he end the video.
Feedback for improvement:
1) Try not to say a lot of "This" and "That". We as viewers who are not physically present there to see your explanation, get confused hell lot, so as to what you are referring to.
2) Try to have a pre-written script or have your concepts very clear. Because at times when you get stuck you just mumble something :P
why did you not consider e & f and also why not the 4 clique graph?
Can we implement /solve the problem through python.
there was a 4-clique in the graph; should not we consider that, because there is no specification that cliques of size 3 has to be formed in groups? pl confirm to the earliest.
I guess c1={a, b} and c2={c, d, e, f}
Plz correct me if i am wrong.
can you please guide on which basis you create two communities like c1 and c2 ??
if you have a cliques of k elements that share at least k-1 elements, you can merge it into 1 community :]
and also what about the 3,8 in the first community?
Bhai apki awaaz Bohot kamm hai
doing great job
but get better microphone
thanx bro
Thanks Bro❤️
thnx a lot