Position-Aware Network Representation Learning via K-Step Mutual Information Estimation

被引:0
|
作者
Chu X. [1 ,2 ]
Fan X. [2 ]
Bi J. [2 ]
机构
[1] University of Chinese Academy of Sciences, Beijing
[2] Institute of Computing Technology, Chinese Academy of Sciences, Beijing
基金
中国国家自然科学基金;
关键词
Information network analysis; Link prediction; Mutual information estimation; Network representation learning; Neural networks; Node classification; Node representation;
D O I
10.7544/issn1000-1239.2021.20210321
中图分类号
学科分类号
摘要
As the network data grows rapidly and persistently, also affiliated with more sophisticated applications, the network representation learning, which aims to learn the high-quality embedding vectors, has become the popular methodology to perform various network analysis tasks. However, the existing representation learning methods have little power in capturing the positional/locational information of the node. To handle the problem, this paper proposes a novel position-aware network representation learning model by figuring out center-rings mutual information estimation to plant the node's global position into the embedding, PMI for short. The proposed PMI encourages each node to respectively perceive its K-step neighbors via the maximization of mutual information between this node and its step-specific neighbors. The extensive experiments using four real-world datasets on several representative tasks demonstrate that PMI can learn high-quality embeddings and achieve the best performance compared with other state-of-the-art models. Furthermore, a novel neighbor alignment experiment is additionally provided to verify that the learned embedding can identify its K-step neighbors and capture the positional information indeed to generate appropriate embeddings for various downstream tasks. © 2021, Science Press. All right reserved.
引用
收藏
页码:1612 / 1623
页数:11
相关论文
共 40 条
  • [1] Perozzi B, Al-Rfou R, Skiena S., DeepWalk: Online learning of social representations, Proc of the 20th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining, pp. 701-710, (2014)
  • [2] Tang Jian, Qu Meng, Wang Mingzhe, Et al., LINE: Large-scale information network embedding, Proc of the 24th Int Conf on World Wide Web, pp. 1067-1077, (2015)
  • [3] Liu Zhiyuan, Sun Maosong, Lin Yankai, Et al., Knowledge representation learning: A review, Journal of Computer Research and Development, 53, 2, pp. 247-261, (2016)
  • [4] Tsoumakas G, Katakis I., Multi-label classification: An overview, International Journal of Data Warehousing and Mining, 3, 3, pp. 1-13, (2007)
  • [5] Yang Shuanghong, Long Bo, Alexander J S, Et al., Like like alike: Joint friendship and interest propagation in social networks, Proc of the 20th Int Conf on World Wide Web, pp. 537-546, (2011)
  • [6] Backstrom L, Leskovec J., Supervised random walks predicting and recommending links in social networks, Proc of the 4th Int Conf on Web Search and Web Data Mining, pp. 635-644, (2011)
  • [7] Leskovec J, Huttenlocher D P, Kleinberg J M., Predicting positive and negative links in online social networks, Proc of the 19th Int Conf on World Wide Web, pp. 641-650, (2010)
  • [8] Long Qingqing, Wang Yiming, Du Lun, Et al., Hierarchical community structure preserving network embedding: A subspace approach, Proc of the 28th Int Conf on Information and Knowledge Management, pp. 409-418, (2018)
  • [9] Wang Xiao, Cui Peng, Wang Jing, Et al., Community preserving network embedding, Proc of the 31st AAAI Conf on Artificial Intelligence, pp. 203-209, (2017)
  • [10] Grover A, Leskovec J., Node2vec: Scalable feature learning for networks, Proc of the 22nd Int Conf on Knowledge Discovery and Data Mining, pp. 855-864, (2016)