access icon free An Efficient and Adaptive Method for Overlapping Community Detection in Real-World Networks

In real-world networks, nodes may belong to more than one community simultaneously. Overlapping community detection in complex networks is a challenging task. An adaptive overlapping community detection method based on seed selection and expansion is proposed. Depending on the restrictions on the seed selection stage, a set of seeds is generated without specified set size. The personalized PageRank algorithm is used to evaluate the community for seed expansion. The uncovered nodes could be adaptively allocated to the appropriate clusters. A thorough comparison between the proposed method and other overlapping community detection methods considered is provided to indicate the effectiveness of the former. The experimental results demonstrate that the presented method is effective.

Inspec keywords: graph theory; network theory (graphs); complex networks

Other keywords: seed expansion; adaptive overlapping community detection method; real-world networks; complex networks; seed selection stage; personalized PageRank algorithm; specified set size

Subjects: Combinatorial mathematics; Combinatorial mathematics; Combinatorial mathematics; Algebra, set theory, and graph theory

http://iet.metastore.ingenta.com/content/journals/10.1049/cje.2017.09.012
Loading

Related content

content/journals/10.1049/cje.2017.09.012
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading