BiANE: Bipartite Attributed Network Embedding

被引:40
作者
Huang, Wentao [1 ]
Li, Yuchen [2 ,3 ]
Fang, Yuan [2 ]
Fan, Ju [1 ]
Yang, Hongxia [4 ]
机构
[1] Renmin Univ China, Beijing, Peoples R China
[2] Singapore Management Univ, Singapore, Singapore
[3] Zhejiang Univ, Hangzhou, Peoples R China
[4] Alibaba Grp, Hangzhou, Peoples R China
来源
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20) | 2020年
基金
新加坡国家研究基金会;
关键词
Network embedding; Bipartite attributed network; Link prediction;
D O I
10.1145/3397271.3401068
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Network embedding effectively transforms complex network data into a low-dimensional vector space and has shown great performance in many real-world scenarios, such as link prediction, node classification, and similarity search. A plethora of methods have been proposed to learn node representations and achieve encouraging results. Nevertheless, little attention has been paid on the embedding technique for bipartite attributed networks, which is a typical data structure for modeling nodes from two distinct partitions. In this paper, we propose a novel model called BiANE, short for Bipartite Attributed Network Embedding. In particular, BiANE not only models the inter-partition proximity but also models the intra-partition proximity. To effectively preserve the intra-partition proximity, we jointly model the attribute proximity and the structure proximity through a novel latent correlation training approach. Furthermore, we propose a dynamic positive sampling technique to overcome the efficiency drawbacks of the existing dynamic negative sampling techniques. Extensive experiments have been conducted on several real-world networks, and the results demonstrate that our proposed approach can significantly outperform state-of-the-art methods.
引用
收藏
页码:149 / 158
页数:10
相关论文
共 51 条
[1]  
[Anonymous], 2012, P 6 ACM C REC SYST, DOI DOI 10.1145/2365952.2365972
[2]  
[Anonymous], 2014, PR MACH LEARN RES
[3]  
Bordes A., 2013, P 27 ANN C NEUR INF, P2787
[4]   A look at interdisciplinarity using bipartite scholar/journal networks [J].
Carusi, Chiara ;
Bianchi, Giuseppe .
SCIENTOMETRICS, 2020, 122 (02) :867-894
[5]   Improving Negative Sampling for Word Representation using Self-embedded Features [J].
Chen, Long ;
Yuan, Fajie ;
Jose, Joemon M. ;
Zhang, Weinan .
WSDM'18: PROCEEDINGS OF THE ELEVENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2018, :99-107
[6]  
Cheng Heng-Tze, P 1 WORKSH DEEP LEAR, pUSA, DOI DOI 10.1145/2988450.2988454
[7]   metapath2vec: Scalable Representation Learning for Heterogeneous Networks [J].
Dong, Yuxiao ;
Chawla, Nitesh V. ;
Swami, Ananthram .
KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, :135-144
[8]   HIN2Vec: Explore Meta-paths in Heterogeneous Information Networks for Representation Learning [J].
Fu, Tao-yang ;
Lee, Wang-Chien ;
Lei, Zhen .
CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, :1797-1806
[9]  
Gao HC, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P3364
[10]   Self-Paced Network Embedding [J].
Gao, Hongchang ;
Huang, Heng .
KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, :1406-1415