Dual-channel hybrid community detection in attributed networks

被引:26
作者
Qin, Meng [1 ]
Lei, Kai [2 ]
机构
[1] Hong Kong Univ Sci & Technol HKUST, Dept Comp Sci & Engn CSE, Hong Kong, Peoples R China
[2] Peking Univ, Sch Elect & Comp Engn SECE, ICNLAB, Shenzhen, Peoples R China
基金
美国国家科学基金会;
关键词
Community detection; Attributed networks; Non-negative matrix factorization; Robustness; Semantic description; OPTIMIZATION; DISCOVERY; OBJECTS;
D O I
10.1016/j.ins.2020.11.010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This study considers the problem of hybrid community detection in attributed networks based on the information of network topology and attributes with the aim to address the following two shortcomings of existing hybrid community detection methods. First, many of these methods are based on the assumption that network topology and attributes carry consistent information but ignore the intrinsic mismatch correlation between them. Second, network topology is typically treated as the dominant source of information, with attributes employed as the auxiliary source; the dominant effect of attributes is seldom explored or indeed considered. To address these limitations, this paper presents a novel Dual-channel Hybrid Community Detection (DHCD) method that considers the dominant effects of topology and attributes separately. The concept of transition relation between the topology and attribute clusters is introduced to explore the mismatch correlation between the two sources and learn the behavioral and content diversity of nodes. An extended overlapping community detection algorithm is introduced based on the two types of diversity. By utilizing network attributes, DHCD can simultaneously derive the community partitioning membership and corresponding semantic descriptions. The superiority of DHCD over state-of-the-art community detection methods is demonstrated on a set of synthetic and real-world networks. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:146 / 167
页数:22
相关论文
共 49 条
[1]  
[Anonymous], 2017, P 31 AAAI C ART INT
[2]  
Balasubramanyan R., 2011, P 2011 SIAM INT C DA, P450, DOI DOI 10.1137/1.9781611972818.39
[3]   Covariate-assisted spectral clustering [J].
Binkiewicz, N. ;
Vogelstein, J. T. ;
Rohe, K. .
BIOMETRIKA, 2017, 104 (02) :361-377
[4]   Latent Dirichlet allocation [J].
Blei, DM ;
Ng, AY ;
Jordan, MI .
JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) :993-1022
[5]   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,
[6]   SVD based initialization: A head start for nonnegative matrix factorization [J].
Boutsidis, C. ;
Gallopoulos, E. .
PATTERN RECOGNITION, 2008, 41 (04) :1350-1362
[7]   Combination of links and node contents for community discovery using a graph regularization approach [J].
Cao, Jinxin ;
Wang, Hongcui ;
Jin, Di ;
Dang, Jianwu .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 91 :361-370
[8]   Autoencoder Based Community Detection with Adaptive Integration of Network Topology and Node Contents [J].
Cao, Jinxin ;
Jin, Di ;
Dang, Jianwu .
KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, KSEM 2018, PT II, 2018, 11062 :184-196
[9]  
Coscia Michele, 2011, Statistical Analysis and Data Mining, V4, P514, DOI 10.1002/sam.10133
[10]   A Survey on Network Embedding [J].
Cui, Peng ;
Wang, Xiao ;
Pei, Jian ;
Zhu, Wenwu .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (05) :833-852