Physics – Data Analysis – Statistics and Probability
Scientific paper
2010-02-09
Physics
Data Analysis, Statistics and Probability
10 pages, 7 Figures. Implementation source and binaries available at http://sites.google.com/site/greedycliqueexpansion/
Scientific paper
In complex networks it is common for each node to belong to several communities, implying a highly overlapping community structure. Recent advances in benchmarking indicate that existing community assignment algorithms that are capable of detecting overlapping communities perform well only when the extent of community overlap is kept to modest levels. To overcome this limitation, we introduce a new community assignment algorithm called Greedy Clique Expansion (GCE). The algorithm identifies distinct cliques as seeds and expands these seeds by greedily optimizing a local fitness function. We perform extensive benchmarks on synthetic data to demonstrate that GCE's good performance is robust across diverse graph topologies. Significantly, GCE is the only algorithm to perform well on these synthetic graphs, in which every node belongs to multiple communities. Furthermore, when put to the task of identifying functional modules in protein interaction data, and college dorm assignments in Facebook friendship data, we find that GCE performs competitively.
Hurley Neil
Lee Conrad
McDaid Aaron
Reid Fergal
No associations
LandOfFree
Detecting highly overlapping community structure by greedy clique expansion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Detecting highly overlapping community structure by greedy clique expansion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting highly overlapping community structure by greedy clique expansion will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-124467