A Degenerate Agglomerative Hierarchical Clustering Algorithm for Community Detection
Community detection consists of grouping related vertices that usually show high intra-cluster connectivity and low inter-cluster connectivity. This is an important feature that many networks exhibit and detecting such communities can be challenging, especially when they are densely connected. The method we propose is a degenerate agglomerative hierarchical clustering algorithm (DAHCA) that aims at finding a community structure in networks. We tested this method using common classes of graph benchmarks and compared it to some state-of-the-art community detection algorithms.
KeywordsCommunity detection Graph clustering Graph theory
- 14.scikit learn: User guide - clustering (2017). http://scikit-learn.org/stable/modules/clustering.html. Accessed 25 Sept 2017