Advanced modularity-specialized label propagation algorithm for detecting communities in networks

Physics – Physics and Society

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 2 figures

Scientific paper

10.1016/j.physa.2009.12.019

A modularity-specialized label propagation algorithm (LPAm) for detecting network communities was recently proposed. This promising algorithm offers some desirable qualities. However, LPAm favors community divisions where all communities are similar in total degree and thus it is prone to get stuck in poor local maxima in the modularity space. To escape local maxima, we employ a multistep greedy agglomerative algorithm (MSG) that can merge multiple pairs of communities at a time. Combining LPAm and MSG, we propose an advanced modularity-specialized label propagation algorithm (LPAm+). Experiments show that LPAm+ successfully detects communities with higher modularity values than ever reported in two commonly used real-world networks. Moreover, LPAm+ offers a fair compromise between accuracy and speed.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Advanced modularity-specialized label propagation algorithm for detecting communities in 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 Advanced modularity-specialized label propagation algorithm for detecting communities in networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Advanced modularity-specialized label propagation algorithm for detecting communities in networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-35624

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.