An attribute-based community search method with graph refining

被引:15
作者
Shang, Jingwen [1 ]
Wang, Chaokun [1 ]
Wang, Changping [1 ]
Guo, Gaoyang [1 ]
Qian, Jun [1 ]
机构
[1] Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Community search; Graph refining; Node attributes; Network topology; COMPLEX NETWORKS; EFFICIENT;
D O I
10.1007/s11227-017-1976-z
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In many complex networks, there exist diverse network topologies as well as node attributes. However, the state-of-the-art community search methods which aim to find out communities containing the query nodes only consider the network topology, but ignore the effect of node attributes. This may lead to the inaccuracy of the predicted communities. In this paper, we propose an attribute-based community search method with graph refining technique, called AGAR. First, we present the concepts of topology-based similarity and attribute-based similarity to construct a TA-graph. The TA-graph can reflect both the relations between nodes from the respect of the network topology and that of the node attributes. Then, we construct AttrTCP-index based on the structure of TA-graph. Finally, by querying the AttrTCP-index, we can find out the communities for the query nodes. Experimental results on real-world networks demonstrate AGAR is an effective and efficient community search method by considering both the network topology and node attributes.
引用
收藏
页码:7777 / 7804
页数:28
相关论文
共 43 条
[1]  
Akoglu L., 2012, P 2012 SIAM INT C DA, P439
[2]  
[Anonymous], 2013, P 22 INT C WORLD WID, DOI [DOI 10.1145/2488388.2488483, 10.1145/2488388.2488483]
[3]   Efficient and effective community search [J].
Barbieri, Nicola ;
Bonchi, Francesco ;
Galimberti, Edoardo ;
Gullo, Francesco .
DATA MINING AND KNOWLEDGE DISCOVERY, 2015, 29 (05) :1406-1433
[4]   Collective Data-Sanitization for Preventing Sensitive Information Inference Attacks in Social Networks [J].
Cai, Zhipeng ;
He, Zaobo ;
Guan, Xin ;
Li, Yingshu .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2018, 15 (04) :577-590
[5]   Dense Subgraph Extraction with Application to Community Detection [J].
Chen, Jie ;
Saad, Yousef .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (07) :1216-1230
[6]   Finding local community structure in networks [J].
Clauset, A .
PHYSICAL REVIEW E, 2005, 72 (02)
[7]  
Clauset A, 2004, PHYS REV E, V70, DOI 10.1103/PhysRevE.70.066111
[8]   Approximation of the Maximal α-Consensus Local Community detection problem in Complex Networks [J].
Conde-Cespedes, Patricia ;
Ngonmang, Blaise ;
Viennet, Emmanuel .
2015 11TH INTERNATIONAL CONFERENCE ON SIGNAL-IMAGE TECHNOLOGY & INTERNET-BASED SYSTEMS (SITIS), 2015, :314-321
[9]  
Cui W., 2013, P 2013 ACM SIGMOD IN, P277
[10]   Local Search of Communities in Large Graphs [J].
Cui, Wanyun ;
Xiao, Yanghua ;
Wang, Haixun ;
Wang, Wei .
SIGMOD'14: PROCEEDINGS OF THE 2014 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2014, :991-1002