DataTerminology.comNEW
Identifying clusters of nodes with dense connections.
DESCRIPTION
Community detection partitions a graph into groups of nodes that are more densely connected internally than externally. It reveals modular structure in social, biological, and information networks. Methods include modularity maximization, label propagation, spectral techniques, and probabilistic models like stochastic block models. Output quality depends on resolution, degree distribution, and algorithmic assumptions. Applications range from fraud rings and customer segmentation to protein complexes. Evaluation uses modularity, conductance, and external ground-truth measures when available. Scalability is achieved with heuristics such as Louvain and Leiden.
ALTERNATIVE DEFINITIONS
Wikipedia
Community detection is the task of finding groups of vertices that are more densely connected internally than with the rest of the network.
Defines the structural property distinguishing communities within networks.
Barabási - Network Science
Community detection seeks to uncover modules in which nodes are more densely linked to each other than to nodes in other modules.
Emphasizes modular organization central to network science.
RELATED TERMS
Graph Clustering Modularity Maximization Louvain Method Spectral Clustering Label Propagation Girvan–Newman Algorithm Network Science Assortativity
COMPETING TERMS
Graph Partitioning Stochastic Block Model
RELATIONS
- Broader: Graph Partitioning
KNOWLEDGE AREAS
AI Data Science Mathematics Semantic & Knowledge Modeling
TARGET AUDIENCE
Data Scientist AI Engineer Information Analyst BI Specialist
EXTERNAL SOURCES
- Wikipedia - Community structure
- Nature Scientific Reports - Leiden method for community detection
- NetworkX - Community algorithms in NetworkX
- igraph - Community detection tutorial
TOP QUESTIONS
What is Community Detection in graphs?
It identifies groups of densely connected nodes, revealing modular structure. Communities often correspond to functional or social groups.
Category: Definition
Which algorithms are widely used for Community Detection?
Louvain and Leiden for modularity; label propagation; spectral clustering; and probabilistic models like stochastic block models.
Category: Overview
How is Community Detection evaluated?
Use modularity, conductance, and normalized mutual information when ground truth exists. Compare stability across resolutions and runs.
Category: Testing
What are common mistakes in Community Detection?
Fixating on modularity alone can miss small or overlapping communities. Ignoring degree heterogeneity biases results.
Category: Mistakes
What risks are associated with Community Detection?
Detected communities can reflect sampling bias or spurious clustering. Misinterpretation may lead to incorrect decisions.
Category: Risks
How to choose resolution in Community Detection?
Tune resolution parameters and inspect multiscale structures. Use domain knowledge and stability analyses to select meaningful partitions.
Category: HowTo
What is the difference between Community Detection and Graph Partitioning?
Community Detection seeks naturally dense modules; Graph Partitioning often enforces balanced cuts and may prioritize computational constraints.
Category: Alternatives
Can Community Detection handle overlapping communities?
Yes, methods like clique percolation or mixed-membership models identify nodes belonging to multiple communities.
Category: Topic
What are practical applications of Community Detection?
Fraud ring identification, customer segmentation, protein complex detection, and topic discovery in citation networks.
Category: Example