The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Detecting highly overlapping community structure by greedy clique expansion
[article]
2010
arXiv
pre-print
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
arXiv:1002.1827v2
fatcat:l277qlm5o5dkxa5zss63kajdu4