Learning Latent Representations of Nodes for Classifying in Heterogeneous Social Networks

被引:77
作者
Jacob, Yann [1 ]
Denoyer, Ludovic
Gallinari, Patrick
机构
[1] UPMC Univ Paris 06, Sorbonne Univ, UMR 7606, LIP6, F-75005 Paris, France
来源
WSDM'14: PROCEEDINGS OF THE 7TH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING | 2014年
关键词
Machine learning; Classification; Social networks; CLASSIFICATION;
D O I
10.1145/2556195.2556225
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Social networks are heterogeneous systems composed of different types of nodes (e.g. users, content, groups, etc.) and relations (e.g. social or similarity relations). While learning and performing inference on homogeneous networks have motivated a large amount of research, few work exists on heterogeneous networks and there are open and challenging issues for existing methods that were previously developed for homogeneous networks. We address here the specific problem of nodes classification and tagging in heterogeneous social networks, where different types of nodes are considered, each type with its own label or tag set. We propose a new method for learning node representations onto a latent space, common to all the different node types. Inference is then performed in this latent space. In this framework, two nodes connected in the network will tend to share similar representations regardless of their types. This allows bypassing limitations of the methods based on direct extensions of homogenous frameworks and exploiting the dependencies and correlations between the different node types. The proposed method is tested on two representative datasets and compared to state-of-the-art methods and to baselines.
引用
收藏
页码:373 / 382
页数:10
相关论文
共 28 条
[1]   Graffiti: graph-based classification in heterogeneous networks [J].
Angelova, Ralitsa ;
Kasneci, Gjergji ;
Weikum, Gerhard .
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2012, 15 (02) :139-170
[2]  
[Anonymous], 2011, P 25 AAAI C ARTIFICI
[3]  
[Anonymous], 2011, P 17 ACM SIGKDD INT
[4]  
[Anonymous], P SIAM INT C DAT MIN
[5]  
[Anonymous], ASONAM
[6]  
[Anonymous], 2004, ADV NEURAL INFORM PR
[7]  
[Anonymous], 2006, Advances in Neural Information Processing Systems
[8]  
[Anonymous], P 4 INT WORKSH ADV I
[9]  
Belkin M, 2006, J MACH LEARN RES, V7, P2399
[10]  
Denoyer L., 2010, ICWSM