Modular Community Detection in Networks
Explore this paper's citation graph
Summary
This paper proposes an iterative rounding strategy for identifying the partition decisions that is coupled with a fast constrained power method that sequentially achieves tighter spectral relaxations and demonstrates consistent and sometimes dramatic improvements in the modularity of the communities discovered.
- Type
- article
- Published
- 2011-07-16
- Cited by
- 57
- References
- 23
- OpenAlex
- https://openalex.org/W134985385
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:6627514
Keywords
Rounding, Modularity (biology), Partition (number theory), Computer science, Modular design
References
- Modularity-Maximizing Graph Communities via Mathematical Programming
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Community structure in social and biological networks
- Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review]
- Data clustering: a review
- GLANCE
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Modularity-maximizing graph communities via mathematical programming
- The Stanford GraphBase: a platform for combinatorial algorithms
- The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations
- Empirical comparison of algorithms for network community detection
- Collective dynamics of ‘small-world’ networks
- An Information Flow Model for Conflict and Fission in Small Groups
- The structure of scientific collaboration networks.
- Normalized cuts and image segmentation
- Modularity and community structure in networks.
- The political blogosphere and the 2004 U.S. election: divided they blog
- Fast normalized cut with linear constraints
- On Spectral Clustering: Analysis and an algorithm
- On Modularity - NP-Completeness and Beyond
Cited by
- Finding Community Structures In Social Activity Data
- Visualizing network communities with a semi-definite programming method
- A Constrained Power Method for Community Detection in Complex Networks
- A parallel Probabilistic Latent Semantic Analysis method on MapReduce platform
- Automated text categorization by generalized kernel machines
- Highlighting data clusters by graph embedding
- Automated network analysis by projected power method
- Modularity-based community detection in large networks: An empirical evaluation
- Modularity maximization in networks by variable neighborhood search
- A scalable community detection algorithm for large graphs using stochastic block models
- A New Relaxation Approach to Normalized Hypergraph Cut
- An Empirical Study of Spectral Social Network Partition on GPGPU Platforms
- An Analysis for the Detection of Network Communities in Dynamic Environments
- Scalable inference for stochastic block models
- Network Community Detection with A Successive Spectral Relaxation Method
- A Self Fixing Intelligent Ant Clustering Algorithm For Graphs
- Three Essays on Network Dynamics and Liminality
- A possibilistic framework for the detection of terrorism‐related Twitter communities in social media
- Forecasting, forewarning weather and disasters in the social web: A network study
- Co-Association Matrix-Based Multi-Layer Fusion for Community Detection in Attributed Networks
Related papers
- Modularity and community structure in networks.
- Community structure in social and biological networks
- Fast unfolding of communities in large networks
- Finding and evaluating community structure in networks.
- Finding community structure in very large networks.
- Revealing network communities with a nonlinear programming method
- Fast normalized cut with linear constraints
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Data clustering: a review
- Networks: An Introduction