Community Detection in Complex Networks Using Density-based Clustering Algorithm

Abstract

Like clustering analysis, community detection aims at assigning nodes in a network into different communities. Fdp is a recently proposed density-based clustering algorithm which does not need the number of clusters as prior input and the result is insensitive to its parameter. However, Fdp cannot be directly applied to community detection due to its inability to recognize the community centers in the network. To solve the problem, a new community detection method (named IsoFdp) is proposed in this paper. First, we use Isomap technique to map the network data into a low dimensional manifold which can reveal diverse pair-wised similarity. Then Fdp is applied to detect the communities in networks. An improved partition density function is proposed to select the proper number of communities automatically. We test our method on both synthetic and real-world networks, and the results demonstrate the effectiveness of our algorithm over the state-of-the-art methods.

References in corpus (9)

• Maps of random walks on complex networks reveal community structure
• Benchmark graphs for testing community detection algorithms
• Community Structure in Jazz
• Navigability of Complex Networks
• Self-similarity of complex networks and hidden metric spaces
• Mixing local and global information for community detection in large networks
• Overlapping Community Detection in Complex Networks using Symmetric Binary Matrix Factorization
• Community detection in bipartite networks using weighted symmetric binary matrix factorization
• Local multiresolution order in community detection

Cited by in corpus (2)

• Applying Machine Learning Techniques for Caching in Edge Networks: A Comprehensive Survey
• Identifying multi-scale communities in networks by asymptotic surprise