Different approaches to community detection
arXiv:1712.06468 · doi:10.1002/9781119483298.ch4
Abstract
A precise definition of what constitutes a community in networks has remained elusive. Consequently, network scientists have compared community detection algorithms on benchmark networks with a particular form of community structure and classified them based on the mathematical techniques they employ. However, this comparison can be misleading because apparent similarities in their mathematical machinery can disguise different reasons for why we would want to employ community detection in the first place. Here we provide a focused review of these different motivations that underpin community detection. This problem-driven classification is useful in applied network science, where it is important to select an appropriate algorithm for the given purpose. Moreover, highlighting the different approaches to community detection also delineates the many lines of research and points out open directions and avenues for future research.
14 pages, 2 figures. Written as a chapter for forthcoming Advances in network clustering and blockmodeling, and based on an extended version of The many facets of community detection in complex networks, Appl. Netw. Sci. 2: 4 (2017) by the same authors
References in corpus (20)
- 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
- Benchmark graphs for testing community detection algorithms
- The structure and dynamics of multilayer networks
- Resolution limit in community detection
- Stochastic blockmodels and community structure in networks
- Community detection in networks: A user guide
- Higher-order organization of complex networks
- The ground truth about metadata and community detection in networks
- Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
- Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
- Phase transition in the detection of modules in sparse networks
- Community detection in networks: Modularity optimization and maximum likelihood are equivalent
- A Classification for Community Discovery Methods in Complex Networks
- Parsimonious module inference in large networks
- Community detection in networks: Structural communities versus ground truth
- Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems