A Classification for Community Discovery Methods in Complex Networks
arXiv:1206.3552 · doi:10.1002/sam.10133
Abstract
In the last few years many real-world networks have been found to show a so-called community structure organization. Much effort has been devoted in the literature to develop methods and algorithms that can efficiently highlight this hidden structure of the network, traditionally by partitioning the graph. Since network representation can be very complex and can contain different variants in the traditional graph model, each algorithm in the literature focuses on some of these properties and establishes, explicitly or implicitly, its own definition of community. According to this definition it then extracts the communities that are able to reflect only some of the features of real communities. The aim of this survey is to provide a manual for the community discovery problem. Given a meta definition of what a community in a social network is, our aim is to organize the main categories of community discovery based on their own definition of community. Given a desired definition of community and the features of a problem (size of network, direction of edges, multidimensionality, and so on) this review paper is designed to provide a set of approaches that researchers could focus on.
Published in the Statistical Analysis and Data Mining journal, Special Issue: Networks. Volume 4, Issue 5, pages 512-546, October 2011
References in corpus (26)
- Fast unfolding of communities in large networks
- Modularity and community structure in networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Finding community structure in networks using the eigenvectors of matrices
- Maps of random walks on complex networks reveal community structure
- Near linear time algorithm to detect community structures in large-scale networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Comparing community structure identification
- Hierarchical structure and the prediction of missing links in networks
- Statistical Mechanics of Community Detection
- Detecting the overlapping and hierarchical community structure of complex networks
- Community structure in directed networks
- Modularity and community detection in bipartite networks
- Detect overlapping and hierarchical community structure in networks
- Line Graphs, Link Partitions and Overlapping Communities
- Mixture models and exploratory analysis in networks
- Community detection in networks with positive and negative links
- Phase transition in the detection of modules in sparse networks
- Extending the definition of modularity to directed graphs with overlapping communities
- Modularity-Maximizing Network Communities via Mathematical Programming
- Size reduction of complex networks preserving modularity
- A Bayesian Approach to Network Modularity
- Analysis of community structure in networks of correlated data
- Community Detection as an Inference Problem
- Unveiling community structures in weighted networks