NEIWalk: Community Discovery in Dynamic Content-Based Networks

被引:51
作者
Wang, Chang-Dong [1 ]
Lai, Jian-Huang [2 ,3 ]
Yu, Philip S. [4 ]
机构
[1] Sun Yat Sen Univ, Sch Mobile Informat Engn, Zhuhai 519082, Peoples R China
[2] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510275, Guangdong, Peoples R China
[3] SYSU CMU Shunde Int Joint Res Inst JRI, Shunde 528300, Peoples R China
[4] Univ Illinois, Chicago, IL 60607 USA
基金
美国国家科学基金会;
关键词
Dynamic community detection; social network; linkage structure; content information; heterogeneous random walk; GRAPH;
D O I
10.1109/TKDE.2013.153
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, discovering dynamic communities has become an increasingly important task. Many algorithms have been proposed, most of which only use linkage structure. However, rich information is encoded in the content of social networks such as node content and edge content, which is essential to discover topically meaningful communities. Therefore, to detect both structurally and topically meaningful communities, linkage structure, node content and edge content should be integrated. The main challenge lies in how to integrate them dynamically in a seamless way. This paper proposes a novel transformation of content-based network into a Node-Edge Interaction (NEI) network where linkage structure, node content and edge content are embedded seamlessly. A differential activity based approach is proposed to incrementally maintain the NEI network as the content-based network evolves. To capture the semantic effect of different edge types, a transition probability matrix is devised for the NEI network. Based on this, heterogeneous random walk is applied to discover dynamic communities, leading to a new dynamic community detection method termed NEIWalk (NEI network based random Walk). Theoretical analysis shows that the proposed NEIWalk method gets a bounded accuracy loss due to the random walk sampling. Experimental results demonstrate the effectiveness and efficiency of NEIWalk.
引用
收藏
页码:1734 / 1748
页数:15
相关论文
共 54 条
[1]  
Aggarwal C.C., 2011, SDM, P355
[2]   Link communities reveal multiscale complexity in networks [J].
Ahn, Yong-Yeol ;
Bagrow, James P. ;
Lehmann, Sune .
NATURE, 2010, 466 (7307) :761-U11
[3]  
Amer-Yahia S., 2007, IEEE DATA ENG B, V30, P23
[4]  
[Anonymous], 2010, Adv. Neural Inf. Proces. Syst.
[5]  
[Anonymous], 2009, PROC 26 ANN INT C M, DOI DOI 10.1145/1553374.1553460
[6]  
[Anonymous], 1999, 199966 STANF INF
[7]  
[Anonymous], 2000, GRAPH CLUSTERING FLO
[8]  
[Anonymous], 2008, P 23 NAT C ART INT
[9]  
[Anonymous], 2006, P 12 ACM SIGKDD INT
[10]  
[Anonymous], 2009, P 26 ANN INT C MACH