Abstract
Overlapping community detection is essential for revealing the hidden structure of complex networks. In this work, we present an overlapping community detection algorithm that selects community centers adaptively based on density peaks. The proposed algorithm, called the density-peak-based overlapping community detection (DPOCD) algorithm, defines point link strength and edge link strength to construct distance matrix. Unlike the density peaks clustering algorithm, by which cluster centers are selected manually, the DPOCD algorithm uses the linear fitting method to select community centers. To evaluate the feasibility of the presented algorithm, we compared it with other advanced methods on artificial synthetic network and real complex network datasets. The experimental results demonstrate that our method achieves excellent performance in large-scale complex networks and the robustness of the algorithm.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call