A framework of community detection based on individual labels in attribute networks

被引:8
作者
Nan, Dong-Yang [1 ]
Yu, Wei [1 ]
Liu, Xiao [1 ]
Zhang, Yun-Peng [4 ]
Dai, Wei-Di [1 ,2 ,3 ]
机构
[1] Tianjin Univ, Sch Comp Sci & Technol, Tianjin 300354, Peoples R China
[2] Tianjin Univ, Tianjin Engn Ctr SmartSafety & Bigdata Technol, Tianjin 300354, Peoples R China
[3] Tianjin Key Lab, Tianjin Key Lab Adv Networking TANK, Tianjin 300354, Peoples R China
[4] Univ Houston, Coll Technol, Houston, TX 77204 USA
基金
中国国家自然科学基金;
关键词
Community detection; Attribute network; Individual label; Non-negative matrix factorization; COMPLEX NETWORKS; INTIMATE DEGREE; NEIGHBORHOOD; ROBUSTNESS; MODEL;
D O I
10.1016/j.physa.2018.08.100
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Community detection is an important problem for understanding the structure and function of complex networks and has attracted a lot of attention in recent decades. Most community detection algorithms only focus on the topology of networks. However, there is still much valuable information hidden in the networks, such as the attributes or content of the nodes and the useful prior information. Obviously, taking full advantage of these resources can improve the effectiveness of community detection. In this paper, we present a semi-supervised community detection framework named SCDAN (Semi-supervised Community Detection in Attribute Networks), in which a non-negative matrix factorization model is utilized to effectively integrate network topology, node attributes and individual labels simultaneously. The comparative experiments on real-world networks show that SCDAN significantly improves the performance of community detection and provides semantic interpretation of communities. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:523 / 536
页数:14
相关论文
共 59 条
[1]   Internet -: Diameter of the World-Wide Web [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 1999, 401 (6749) :130-131
[2]   Community detection with and without prior information [J].
Allahverdyan, A. E. ;
Steeg, G. Ver ;
Galstyan, A. .
EPL, 2010, 90 (01)
[3]  
[Anonymous], 2001, ICML
[4]  
[Anonymous], 2016, PROC 25 INT JOINT C, DOI DOI 10.5555/3060832.3060936
[5]  
[Anonymous], 24 INT JOINT C ART I
[6]  
[Anonymous], 1993, ACTA NUMER, DOI DOI 10.1017/S096249290000235X
[7]   Size and form in efficient transportation networks [J].
Banavar, JR ;
Maritan, A ;
Rinaldo, A .
NATURE, 1999, 399 (6732) :130-132
[8]   Latent Dirichlet allocation [J].
Blei, DM ;
Ng, AY ;
Jordan, MI .
JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) :993-1022
[9]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[10]  
Chen K., 2017, J AM STAT ASSOC, P1