• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science

Previous Articles     Next Articles

Link representation and prediction
based on the simplest subgraph

SHANG Zhenhao,CHENG Hua,FANG Yiquan   

  1. (School of Information Science and Engineering,East China University of Science and Technology,Shanghai 200237,China)
  • Received:2018-04-23 Revised:2018-07-12 Online:2019-02-25 Published:2019-02-25

Abstract:

Traditional link prediction methods of sparse networks have low accuracy. In order to capture the possibility of link establishment among sparse network nodes, we propose the concept of simplest subgraph based on the shortest path between a pair of nodes, which reflects the tight topology relationship between nodes. Based on the node2vec node vectorization method, the link representation based on the shortest path is implemented. To complete the link classification task, we use the long short-term memory (LSTM) recurrent neural network to learn the characteristics of long-link node sequences. Compared with existing methods, the proposed method can increase the AUC value on 4 different datasets by 11.6% averagely, and the AP value by an average of 13.3%.


 

Key words: shortest path, simplest subgraph, link representation, LSTM, link prediction