Journal
NEUROCOMPUTING
Volume 226, Issue -, Pages 7-15Publisher
ELSEVIER
DOI: 10.1016/j.neucom.2016.11.019
Keywords
Overlapping community; Density peak; Community core; Membership vector; Social networks
Categories
Funding
- National Natural Science Foundation of China [61373050]
- Science Technology Development Project From Jilin Province of China [20130206003SF, 20130101070JC]
Ask authors/readers for more resources
Many real-world networks contain overlapping communities like protein-protein networks and social networks. Overlapping community detection plays an important role in studying hidden structure of those networks. In this paper, we propose a novel overlapping community detection algorithm based on density peaks (OCDDP). OCDDP utilizes a similarity based method to set distances among nodes, a three-step process to select cores of communities and membership vectors to represent belongings of nodes. Experiments on synthetic networks and social networks prove that OCDDP is an effective and stable overlapping community detection algorithm. Compared with the top existing methods, it tends to perform better on those simple structure networks rather than those infrequently complicated ones.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available