期刊
MODERN PHYSICS LETTERS B
卷 31, 期 14, 页码 -出版社
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0217984917501585
关键词
Signed network; community detection; modularity; the greedy algorithm; computational complexity
资金
- National Natural Science Foundation of China [71473283]
- Beijing Municipal Natural Science Foundation [9152017]
- National Social Science Foundation of China [12CSH037]
The formality of signed relationships has been recently adopted in a lot of complicated systems. The relations among these entities are complicated and multifarious. We cannot indicate these relationships only by positive links, and signed networks have been becoming more and more universal in the study of social networks when community is being significant. In this paper, to identify communities in signed networks, we exploit a new greedy algorithm, taking signs and the density of these links into account. The main idea of the algorithm is the initial procedure of signed modularity and the corresponding update rules. Specially, we employ the Asymmetric and Constrained Belief Evolution procedure to evaluate the optimal number of communities. According to the experimental results, the algorithm is proved to be able to run well. More specifically, the proposed algorithm is very efficient for these networks with medium size, both dense and sparse.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据