An algorithm based on positive and negative links for community detection in signed networks.

ABSTRACT: Community detection problem in networks has received a great deal of attention during the past decade. Most of community detection algorithms took into account only positive links, but they are not suitable for signed networks. In our work, we propose an algorithm based on random walks for community detection in signed networks. Firstly, the local maximum degree node which has a larger degree compared with its neighbors is identified, and the initial communities are detected based on local maximum degree nodes. Then, we calculate a probability for the node to be attracted into a community by positive links based on random walks, as well as a probability for the node to be away from the community on the basis of negative links. If the former probability is larger than the latter, then it is

SUBMITTER: Su Y 

PROVIDER: S-EPMC5589891 | biostudies-literature | 2017 Sep

REPOSITORIES: biostudies-literature