Label propagation for clustering

Abstract

Label propagation is a heuristic method initially proposed for community detection in networks, while the method can be adopted also for other types of network clustering and partitioning. Among all the approaches and techniques described in this book, label propagation is neither the most accurate nor the most robust method. It is, however, without doubt one of the simplest and fastest clustering methods. Label propagation can be implemented with a few lines of programming code and applied to networks with hundreds of millions of nodes and edges on a standard computer, which is true only for a handful of other methods in the literature. In this chapter, we present the basic framework of label propagation, review different advances and extensions of the original method, and highlight its equivalences with other approaches. We show how label propagation can be used effectively for large-scale community detection, graph partitioning, identification of structurally equivalent nodes and other network structures. We conclude the chapter with a summary of the label propagation methods and suggestions for future research.

27 pages, 13 figures, 2 tables, chapter in "Advances in Network Clustering and Blockmodeling" edited by P. Doreian, V. Batagelj & A. Ferligoj (Wiley, New York, 2018)

References in corpus (22)

• Fast unfolding of communities in large networks
• Cooperative Game Theory Approaches for Network Partitioning
• 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
• The structure and dynamics of multilayer networks
• Statistical Mechanics of Community Detection
• Community detection in networks: A user guide
• Consensus clustering in complex networks
• Modularity and community detection in bipartite networks
• Narrow scope for resolution-limit-free community detection
• Detecting network communities by propagating labels under constraints
• Towards real-time community detection in large networks
• Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction
• Robust network community detection using balanced propagation
• Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement
• The many facets of community detection in complex networks
• Note on the equivalence of the label propagation method of community detection and a Potts model approach
• Community detection by label propagation with compression of flow
• Multi-resolution community detection in massive networks
• On the relationship between Gaussian stochastic blockmodels and label propagation algorithms
• Corrected overlap weight and clustering coefficient

Cited by in corpus (2)

• Large network community detection by fast label propagation
• Learning Physical Graph Representations from Visual Scenes