Overlapping Community Detection in Networks: the State of the Art and Comparative Study

Details Overlapping Community Detection in Networks: the State of the Art and Comparative Study Overlapping Community Detection in Networks: the State of the Art and Comparative Study

2011-10-26

arxiv.org/abs/1110.5813v3

Computer Science

Social and Information Networks

xiej2@rpi.edu

Scientific paper

This paper reviews the state of the art in overlapping community detection algorithms, quality measures, and benchmarks. A thorough comparison of different algorithms is provided. In addition to community level evaluation, we propose a novel framework for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection. We conclude that SLPA, OSLOM, Game, and COPRA offer the best performance. A common feature observed by various algorithms in real-world networks is the relatively small fraction of overlapping nodes (typically less than 30%), each of which belongs to only 2 or 3 communities.

Affiliated with

Also associated with

No associations

Rating

Overlapping Community Detection in Networks: the State of the Art and Comparative Study 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 Overlapping Community Detection in Networks: the State of the Art and Comparative Study, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Overlapping Community Detection in Networks: the State of the Art and Comparative Study will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717820