Yes, I am searching for methods that discover subgraphs or communities in graphs that don't contain any clique. Actually, what I really want is a method to find a partition of edges, not nodes. Anyway, the two recommended papers are very useful to me. Thank you very much. Any other suggestions would be very welcomed. Thanks again.
Sirinda Date: Wed, 14 Mar 2012 22:30:50 +0800 From: [email protected] To: [email protected] Subject: Re: [igraph] overlapping community detection Hi Sirinda, I think you mean the method unrelated of Clique Percolation Method. You can check this paper http://www.sciencedirect.com/science/article/pii/S0370157309002841 It's a summarize about community detection and you can find out what you want in subsection B of section XI. Evan 2012/3/14 Sirinda Palahan <[email protected]> Hi all, I was wondering if there is any community detection algorithms that return overlapping communities where communities are just subgraphs and not cliques. Most of overlapping community detection papers I have read so far define a community as a clique. But my networks don't contain any cliques. I like the results I got from fast_greedy and would like to know if there is any extension of it that return overlapping clusters. Any paper suggestion would be appreciated or a suggestion how I should modify the fast_greedy so each vertex can belong to more than one cluster. thank you very much. Sirinda _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
