Hierarchical Community Structure Preserving Network Embedding: A Subspace Approach

被引:36
作者
Long, Qingqing [1 ]
Wang, Yiming [1 ]
Du, Lun [2 ,4 ]
Song, Guojie [1 ]
Jin, Yilun [1 ]
Lin, Wei [3 ]
机构
[1] Peking Univ, Minist Educ, Key Lab Machine Percept, Beijing, Peoples R China
[2] Microsoft Res, Washington, DC USA
[3] Alibaba Grp, Hangzhou, Peoples R China
[4] Peking Univ, Beijing, Peoples R China
来源
PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19) | 2019年
基金
中国国家自然科学基金;
关键词
Network embedding; subspace; complex networks; community structure; data mining;
D O I
10.1145/3357384.3357947
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
To depict ubiquitous relational data in real world, network data are widely applied in modeling complex relationships. Projecting vertices to low dimensional spaces, quoted as Network Embedding, would thus be applicable to diverse predicative tasks. Numerous works exploiting pairwise proximities, one characteristic owned by real networks, the clustering property, namely vertices are inclined to form communities of various ranges and hence form a hierarchy consisting of communities, has barely received attention from researchers. In this paper, we propose our network embedding framework, abbreviated SpaceNE, preserving hierarchies formed by communities through subspaces, manifolds with flexible dimensionalities and are inherently hierarchical. Moreover, we propose that subspaces are able to address further problems in representing hierarchical communities, including sparsity and space warps. Last but not least, we proposed constraints on dimensions of subspaces to denoise, which are further approximated by differentiable functions such that joint optimization is enabled, along with a layer-wise scheme to alleviate the overhead cause by vast number of parameters. We conduct various experiments with results demonstrating our model's effectiveness in addressing community hierarchies.
引用
收藏
页码:409 / 418
页数:10
相关论文
共 37 条
[1]  
[Anonymous], 2014, 20 ACM SIGKDD INT C, DOI DOI 10.1145/2623330.2623732
[2]  
BJORCK A, 1994, LINEAR ALGEBRA APPL, V198, P297
[3]   Exact Matrix Completion via Convex Optimization [J].
Candes, Emmanuel J. ;
Recht, Benjamin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (06) :717-772
[4]   Hierarchical structure and the prediction of missing links in networks [J].
Clauset, Aaron ;
Moore, Cristopher ;
Newman, M. E. J. .
NATURE, 2008, 453 (7191) :98-101
[5]  
Clauset Aaron, 2007, STAT NETW AN MOD ISS, P1
[6]  
Cui Z, 2018, 2018 IEEE THIRD INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, APPLICATIONS AND SYSTEMS (IPAS), P1, DOI 10.1109/IPAS.2018.8708883
[7]  
Ding C., 2006, P 23 INT C MACH LEAR, P281, DOI DOI 10.1145/1143844.1143880
[8]  
Du L, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2086
[9]  
Du L, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2079
[10]   Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation [J].
Fouss, Francois ;
Pirotte, Alain ;
Renders, Jean-Michel ;
Saerens, Marco .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (03) :355-369