基于贡献函数的重叠社区划分算法

刘功申; 孟魁; 郭弘毅; 苏波; 李建华

doi:10.11999/JEIT161109

基于贡献函数的重叠社区划分算法

doi: 10.11999/JEIT161109

基金项目:

国家973关键技术研究项目(2013CB329603)，国家自然科学基金(61472248)

计量
- 文章访问数: 1253
- HTML全文浏览量: 130
- PDF下载量: 409
- 被引次数: 0
出版历程
- 收稿日期: 2016-10-18
- 修回日期: 2017-04-24
- 刊出日期: 2017-08-19

Overlapping-communities Recognition Algorithm Based on Contribution Function

Funds:

The National 973 Key Basic Research Program of China (2013CB329603), The National Natural Science Foundation of China (61472248)

摘要

摘要: 现实世界中的网络结构呈现出重叠社区的特征。在研究经典的标签算法的基础上，该文提出基于贡献函数的重叠社区发现算法。算法将每个节点用三元组(阈值、标签、从属系数)集合来表示。节点的阈值是每次迭代过程中标签淘汰的依据，该值由多元线性方程自动计算而来。从属系数用于衡量当前节点与标签所标识社区的相关度，从属系数的值越大说明该节点与标签所标识社区的关联性越强。在每一次迭代的过程中，算法依据贡献函数计算每个节点的从属系数，并生成新的三元组集合。然后依据标签决策规则淘汰标签，进行从属系数规范化。通过对真实的复杂网络和LFR(Lancichinetti Fortunato Radicchi)自动生成的网络进行测试可知，该算法的社区划分准确率高，而且划分结果稳定。
- 复杂网络 /
- 社区发现 /
- 重叠社区
Abstract: Overlapping is one of the most important characteristics of real-world networks. Based on the classic labeling algorithm, the overlapping-community orientated label propagation algorithm based on contribution function is proposed. In this algorithm, each node is indicated by a set of triples (threshold, label, and coefficient). The threshold value of every node is used as a metric for labels decision, which is calculated automatically by multiple linear regression equation. The dependent coefficient is used to measure the relevance of the current node with the correspondent community which is marked by the label. A greater value of dependent coefficient means a stronger association between the node and the community. During each iteration process, the dependent coefficients are calculated through Contribution Function (CF) of each node, and new triples are produced. Then the labels in terms of decision rules are selected, and the dependent coefficients of the node are normalized. According to the tests with real-world networks and automatic generation of LFR (Lancichinetti Fortunato Radicchi) test network, the algorithm can divide communication with high accuracy and robust result.
- Complex networks /
- Communities detecting /
- Overlapping communities

HTML全文

参考文献(15)

WANG Xiaofeng, LIU Gongshen, PAN Li, et al. Uncovering fuzzy communities in networks with structural similarity[J]. Neurocomputing, 2016, 210(1): 26-33.

PALLA G, DERENVI I, FARKAS I, et al. Uncovering the overlapping community structure of complex networks in nature and society[J]. Nature, 2005, 435(7043): 814-818.

LEE C, REID F, McDAID A, et al. Detecting highly overlapping community structure by greedy clique expansion [C]. ACM International Conference on Paper Presented at SNA-KDD Workshop, Washington DC, USA, 2010. arXiv: 1002.1827.

GREGORY S. An algorithm to find overlapping community structure in networks[J]. LNCS, 2007, 4702(12): 91-102.

SHI Xiaohua. Community detection in social network with pair wisely constrained symmetric non-negative matrix factorization[C]. Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Paris, France, 2015: 541-546.

LIU Xiao, WEI Yiming, WANG Jian, et al. Community detection enhancement using no-negative matrix factorization with graph regularization[J]. International Journal of Modern Physics B, 2016, 30(20): 1650130.

WANG Zhaoxian, WANG Wenjun, XUE Guixiang, et al. Semi-supervised community detection framework based on non-negative factorization using individual labels[C], The Sixth International Conference on Swarm Intelligence, Beijing, China, 2015, 349-359

RAGHAVAN U N, ALBERT R, and KUMARA S. Near linear time algorithm to detect community structures in large-scale networks[J]. Physical Review E Statistical Nonlinear Soft Matter Physics, 2007, 76(3 Pt 2):036106.

GREGORY S. Finding overlapping communities in networks by label propagation[J]. New Journal of Physics, 2009, 12(10): 2011-2024.

ULRIK B. A faster algorithm for betweenness centrality[J]. Journal of Mathematical Sociology, 2001, 25(2): 163-177.

EPPSTEIN D and WANG J. Fast approximation of gentrality[J]. Journal of Graph Algorithms and Applications, 2004, 8(1): 39-45.

KLEINBERG J M. Authoritative sources in a hyperlinked environment[J]. Journal of the ACM (JACM), 1999, 46(5): 604-632.

NICOSIA V, MANGIONI G, CARCHIOLO V, et al. Extending the definition of modularity to directed graphs with overlapping communities[J]. Journal of Statistical Mechanics Theory Experiment, 2009, 2009(3): 3166-3168.

LANCICHINETTI A, FORTUNATO S, and RADICCHI F. Benchmark graphs for testing community detection algorithms[J]. Physical Review E Statistical Nonlinear Soft Matter Physics, 2008, 78(2): 046110.

CAO Xiaochun, WANG Xiao, JIN Di, et al. Identifying overlapping communities as well as hubs and outliers via nonnegative matrix factorization[J]. Scientific Reports, 2013, 03: 2993. doi: 10.1038/srep02993.

施引文献

资源附件(0)

访问统计