An improved local community detection algorithm using selection probability

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In order to find the structure of local community more effectively, we propose an improved local community detection algorithm ILCDSP, which improves the node selection strategy, and sets selection probability value for every candidate node. ILCDSP assigns nodes with different selection probability values, which are equal to the degree of the nodes to be chosen. By this kind of strategy, the proposed algorithm can detect the local communities effectively, since it can ensure the best search direction and avoid the local optimal solution. Various experimental results on both synthetic and real networks demonstrate that the quality of the local communities detected by our algorithm is significantly superior to the state-of-the-art methods. © 2014 Shixiong Xia et al.

Cite

CITATION STYLE

APA

Xia, S., Zhou, R., Zhou, Y., & Zhu, M. (2014). An improved local community detection algorithm using selection probability. Mathematical Problems in Engineering, 2014. https://doi.org/10.1155/2014/406485

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free