Community discovery algorithms: an overview
From MaRDI portal
Recommendations
Cited in
(19)- Group detection in complex networks: an algorithm and comparison of the state of the art
- Community detection by resistance distance: automation and benchmark testing
- On community structure validation in real networks
- ABACUS: frequent pattern mining-based community discovery in multidimensional networks
- Communities and their role in small world graphs
- Community identification algorithm using relative edge density measure
- Complex network clustering algorithms
- Finding strongly knit clusters in social networks
- Defining and identifying cograph communities in complex networks
- Identify implicit communities by graph clustering
- Community structure in social and biological networks
- An analysis and comparison of community detection algorithms in online social networks
- Clustering and community detection in directed networks: a survey
- Community search over big graphs
- Computing Communities in Large Networks Using Random Walks
- Centrality based community discovery
- ma-CODE: a multi-phase approach on community detection in evolving networks
- Community detection: concepts, algorithms, evaluation and challenges
- Detection of structurally homogeneous subsets in graphs
This page was built for publication: Community discovery algorithms: an overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581945)
