Community detection using multitopology and attributes in social networks

被引:1
作者
Liu, Changzheng [1 ]
Huang, Fengling [1 ]
Li, Ruixuan [1 ]
Yang, Qi [1 ]
Li, Yuhua [1 ]
Yu, Shui [2 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Hubei, Peoples R China
[2] Peng Cheng Lab, Cyberspace Secur Res Ctr, Shenzhen, Peoples R China
基金
中国国家自然科学基金;
关键词
common neighbor attribute; community detection; community kernels; multilayer structure; random walk; COMPLEX NETWORKS; RANDOM-WALKS; MULTISCALE;
D O I
10.1002/cpe.6028
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Community detection is a fundamental research problem in social networks. However, most existing research focuses on homogeneous networks while ignoring the multitopology and attributes in social media. In this article, we propose community detection algorithms based on community kernels to detect high-quality communities in heterogeneous social networks. It is noticed that the social community has multiple topology structures, as nodes or users in social media networks have multiple attributions. For example, users can be friends and coworkers in a research group simultaneously. Hence, we propose a multilayer and attribute combined measure (MACM), a novel measurement based on the multilayer structure and common neighboring attributes, which includes the similarity measure between nodes and the importance measure for individual node in multilayer networks. Two improved community kernel detection algorithms based on MACM are subsequently proposed. They are the MA-Greedy, which is based on the greedy algorithm, and the MA-WeBA, which is a weighted balanced algorithm. The multilayer structure and attributes are comprehensively considered when calculating the similarity and importance of nodes in these strategies. Extensive experimental results on two public data sets demonstrate that the multilayer structure and attribute information can be used to enhance the precision of community detection.
引用
收藏
页数:17
相关论文
共 32 条
[1]  
Andersen R, 2006, ANN IEEE SYMP FOUND, P475
[2]  
Chakraborty T, 2016, PROC INT CONF DATA, P397, DOI 10.1109/ICDE.2016.7498257
[3]   Clustering by passing messages between data points [J].
Frey, Brendan J. ;
Dueck, Delbert .
SCIENCE, 2007, 315 (5814) :972-976
[4]   Community structure in social and biological networks [J].
Girvan, M ;
Newman, MEJ .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (12) :7821-7826
[5]   Community detection in multi-relational social networks based on relational concept analysis [J].
Guesmi, Soumaya ;
Trabelsi, Chiraz ;
Latiri, Chiraz .
KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS (KES 2019), 2019, 159 :291-300
[6]   COMMUNITY DETECTION IN MULTIPLEX NETWORKS: A SEED-CENTRIC APPROACH [J].
Hmimida, Manel ;
Kanawati, Rushed .
NETWORKS AND HETEROGENEOUS MEDIA, 2015, 10 (01) :71-85
[7]   Detecting Common Interest Kernels in Large Social Networks [J].
Hu, Weishu ;
Hou, Leong U. ;
Gong, Zhiguo .
2012 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT 2012), VOL 1, 2012, :724-731
[8]   Think locally, act locally: Detection of small, medium-sized, and large communities in large networks [J].
Jeub, Lucas G. S. ;
Balachandran, Prakash ;
Porter, Mason A. ;
Mucha, Peter J. ;
Mahoney, Michael W. .
PHYSICAL REVIEW E, 2015, 91 (01)
[9]  
Kanawati R, 2014, 2014 INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA), P46, DOI 10.1109/DSAA.2014.7058050
[10]  
Khorasgani ReihanehRabbany., 2010, 4 SNA KDD WORKSH SOC, P228