Computer Science – Data Structures and Algorithms
Scientific paper
2008-09-25
Phys. Rev. E 78, 026112 (2008)
Computer Science
Data Structures and Algorithms
17 pages, 2 figures
Scientific paper
10.1103/PhysRevE.78.026112
We have recently introduced a multistep extension of the greedy algorithm for modularity optimization. The extension is based on the idea that merging l pairs of communities (l>1) at each iteration prevents premature condensation into few large communities. Here, an empirical formula is presented for the choice of the step width l that generates partitions with (close to) optimal modularity for 17 real-world and 1100 computer-generated networks. Furthermore, an in-depth analysis of the communities of two real-world networks (the metabolic network of the bacterium E. coli and the graph of coappearing words in the titles of papers coauthored by Martin Karplus) provides evidence that the partition obtained by the multistep greedy algorithm is superior to the one generated by the original greedy algorithm not only with respect to modularity but also according to objective criteria. In other words, the multistep extension of the greedy algorithm reduces the danger of getting trapped in local optima of modularity and generates more reasonable partitions.
Caflisch Amedeo
Schuetz Philipp
No associations
LandOfFree
Multistep greedy algorithm identifies community structure in real-world and computer-generated networks 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 Multistep greedy algorithm identifies community structure in real-world and computer-generated networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multistep greedy algorithm identifies community structure in real-world and computer-generated networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-181933