A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Algorithms for graph partitioning on the planted partition model
Random Structures & Algorithms
IEEE Internet Computing
Graph evolution: Densification and shrinking diameters
ACM Transactions on Knowledge Discovery from Data (TKDD)
Pattern Recognition Letters
The dynamics of viral marketing
ACM Transactions on the Web (TWEB)
An Algorithm to Find Overlapping Community Structure in Networks
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
A Fast Algorithm to Find Overlapping Communities in Networks
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Overlapping community structure detection in networks
Proceedings of the 17th ACM conference on Information and knowledge management
Multiplicative Mixture Models for Overlapping Clustering
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Parallel community detection on large networks with propinquity dynamics
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Fuzzy Variant of Affinity Propagation in Comparison to Median Fuzzy c-Means
WSOM '09 Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps
A Visual Data Mining Approach to Find Overlapping Communities in Networks
ASONAM '09 Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining
Uncovering Overlap Community Structure in Complex Networks Using Particle Competition
AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
Generalized external indexes for comparing data partitions with overlapping categories
Pattern Recognition Letters
A game-theoretic framework to identify overlapping communities in social networks
Data Mining and Knowledge Discovery
Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
Overlapping Community Detection by Collective Friendship Group Inference
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
Detection of Overlapping Communities in Dynamical Social Networks
SOCIALCOM '10 Proceedings of the 2010 IEEE Second International Conference on Social Computing
Partitioning Breaks Communities
ASONAM '11 Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and Mining
ICDMW '11 Proceedings of the 2011 IEEE 11th International Conference on Data Mining Workshops
Community detection using a neighborhood strength driven Label Propagation Algorithm
NSW '11 Proceedings of the 2011 IEEE Network Science Workshop
Towards linear time overlapping community detection in social networks
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Computer science fields as ground-truth communities: their impact, rise and fall
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Topic model-based link community detection with adjustable range of overlapping
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Detecting profilable and overlapping communities with user-generated multimedia contents in LBSNs
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Scalable parallel OPTICS data clustering using graph algorithmic techniques
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Overlapping community detection using seed set expansion
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Detecting cohesive and 2-mode communities indirected and undirected networks
Proceedings of the 7th ACM international conference on Web search and data mining
Extending market basket analysis with graph mining techniques: A real case
Expert Systems with Applications: An International Journal
High quality, scalable and parallel community detection for large real graphs
Proceedings of the 23rd international conference on World wide web
An efficient algorithm for community mining with overlap in social networks
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
This article reviews the state-of-the-art in overlapping community detection algorithms, quality measures, and benchmarks. A thorough comparison of different algorithms (a total of fourteen) is provided. In addition to community-level evaluation, we propose a framework for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection. After considering community-level detection performance measured by normalized mutual information, the Omega index, and node-level detection performance measured by F-score, we reached the following conclusions. For low overlapping density networks, SLPA, OSLOM, Game, and COPRA offer better performance than the other tested algorithms. For networks with high overlapping density and high overlapping diversity, both SLPA and Game provide relatively stable performance. However, test results also suggest that the detection in such networks is still not yet fully resolved. 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.