On Accuracy of Community Structure Discovery Algorithms

Computer Science – Social and Information Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Community structure discovery in complex networks is a quite challenging problem spanning many applications in various disciplines such as biology, social network and physics. Emerging from various approaches numerous algorithms have been proposed to tackle this problem. Nevertheless little attention has been devoted to compare their efficiency on realistic simulated data. To better understand their relative performances, we evaluate systematically eleven algorithms covering the main approaches. The Normalized Mutual Information (NMI) measure is used to assess the quality of the discovered community structure from controlled artificial networks with realistic topological properties. Results show that along with the network size, the average proportion of intra-community to inter-community links is the most influential parameter on performances. Overall, "Infomap" is the leading algorithm, followed by "Walktrap", "SpinGlass" and "Louvain" which also achieve good consistency.

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

On Accuracy of Community Structure Discovery Algorithms 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 On Accuracy of Community Structure Discovery Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Accuracy of Community Structure Discovery Algorithms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-25819

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