MSNE: A Novel Markov Chain Sampling Strategy for Network Embedding

被引:0
作者
Wang, Ran [1 ]
Song, Yang [1 ]
Dai, Xin-yu [1 ]
机构
[1] Nanjing Univ, Natl Key Lab Novel Software Technol, Nanjing 210023, Peoples R China
来源
ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2019, PT III | 2019年 / 11441卷
基金
美国国家科学基金会;
关键词
Network embedding; Random walk; Sampling strategy;
D O I
10.1007/978-3-030-16142-2_9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Network embedding methods have obtained great progresses on many tasks, such as node classification and link prediction. Sampling strategy is very important in network embedding. It is still a challenge for sampling in a network with complicated topology structure. In this paper, we propose a high-order Markov chain Sampling strategy for Network Embedding (MSNE). MSNE selects the next sampled node based on a distance metric between nodes. Due to high-order sampling, it can exploit the whole sampled path to capture network properties and generate expressive node sequences which are beneficial for downstream tasks. We conduct the experiments on several benchmark datasets. The results show that our model can achieve substantial improvements in two tasks of node classification and link prediction. (Datasets and code are available at https://github.com/SongY123/MSNE.)
引用
收藏
页码:107 / 118
页数:12
相关论文
共 20 条
[1]  
[Anonymous], 2000, Journal of Social Structure
[2]  
[Anonymous], 2013, P INT C COMP LEARN R
[3]  
[Anonymous], 2017, GRADUATE TEXTS MATH, DOI [DOI 10.1007/978-3-662-53622-3, 10.1007/978-3-662-53622-3]
[4]   The BioGRID interaction database:: 2008 update [J].
Breitkreutz, Bobby-Joe ;
Stark, Chris ;
Reguly, Teresa ;
Boucher, Lorrie ;
Breitkreutz, Ashton ;
Livstone, Michael ;
Oughtred, Rose ;
Lackner, Daniel H. ;
Bahler, Jurg ;
Wood, Valerie ;
Dolinski, Kara ;
Tyers, Mike .
NUCLEIC ACIDS RESEARCH, 2008, 36 :D637-D640
[5]   The small world of human language [J].
Cancho, RFI ;
Solé, RV .
PROCEEDINGS OF THE ROYAL SOCIETY B-BIOLOGICAL SCIENCES, 2001, 268 (1482) :2261-2265
[6]  
Cao S., 2015, P C INF KNOWL MAN, P891, DOI 10.1145/2806416.2806512
[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]   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
[9]   SINGULAR VALUE DECOMPOSITION AND LEAST SQUARES SOLUTIONS [J].
GOLUB, GH ;
REINSCH, C .
NUMERISCHE MATHEMATIK, 1970, 14 (05) :403-&
[10]   node2vec: Scalable Feature Learning for Networks [J].
Grover, Aditya ;
Leskovec, Jure .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :855-864