Toward an Adaptive Skip-Gram Model for Network Representation Learning

I. Chung Hsieh, Cheng Te Li

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)

摘要

The random walk process on network data is a widely-used approach for network representation learning. However, we argue that the sampling of node sequences and the subsampling for the Skip-gram's contexts have two drawbacks. One is less possible to precisely find the most correlated context nodes for every central node with only uniform graph search. The other is not easily controlled due to the expensive cost of hyperparameter tuning. Such two drawbacks lead to higher training cost and lower accuracy due to abundant and irrelevant samples. To solve these problems, we compute the adaptive probability of random walk based on Personalized PageRank (PPR), and propose an Adaptive SKip-gram (ASK) model without using complicated sampling process and negative sampling. We utilize k-most important neighbors for positive samples selection, and attach their corresponding PPR probability into the objective function. Based on benchmark datasets with three citation networks and three social networks, we demonstrate the improvement of our ASK model for network representation learning in tasks of link prediction, node classification, and embedding visualization. The results achieve more effective performance and efficient learning time.

原文English
頁(從 - 到)37506-37514
頁數9
期刊IEEE Access
10
DOIs
出版狀態Published - 2022

All Science Journal Classification (ASJC) codes

  • 一般電腦科學
  • 一般材料科學
  • 一般工程

指紋

深入研究「Toward an Adaptive Skip-Gram Model for Network Representation Learning」主題。共同形成了獨特的指紋。

引用此