FAST COMMUNITY IDENTIFICATION BY HIERARCHICAL GROWTH
From MaRDI portal
Publication:3499084
Abstract: A new method for community identification is proposed which is founded on the analysis of successive neighborhoods, reached through hierarchical growth from a starting vertex, and on the definition of communities as a subgraph whose number of inner connections is larger than outer connections. In order to determine the precision and speed of the method, it is compared with one of the most popular community identification approaches, namely Girvan and Newman's algorithm. Although the hierarchical growth method is not as precise as Girvan and Newman's method, it is potentially faster than most community finding algorithms.
Recommendations
Cites work
Cited in
(6)- Identify implicit communities by graph clustering
- Fast hyperbolic mapping based on the hierarchical community structure in complex networks
- A fast and efficient algorithm to identify clusters in networks
- Hierarchies of predominantly connected communities
- Fast unfolding of communities in large networks
- Fast community detection by SCORE
This page was built for publication: FAST COMMUNITY IDENTIFICATION BY HIERARCHICAL GROWTH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499084)