HeteSpaceyWalk: A Heterogeneous Spacey Random Walk for Heterogeneous Information Network Embedding
arXiv:1909.03228
Abstract
Heterogeneous information network (HIN) embedding has gained increasing interests recently. However, the current way of random-walk based HIN embedding methods have paid few attention to the higher-order Markov chain nature of meta-path guided random walks, especially to the stationarity issue. In this paper, we systematically formalize the meta-path guided random walk as a higher-order Markov chain process, and present a heterogeneous personalized spacey random walk to efficiently and effectively attain the expected stationary distribution among nodes. Then we propose a generalized scalable framework to leverage the heterogeneous personalized spacey random walk to learn embeddings for multiple types of nodes in an HIN guided by a meta-path, a meta-graph, and a meta-schema respectively. We conduct extensive experiments in several heterogeneous networks and demonstrate that our methods substantially outperform the existing state-of-the-art network embedding algorithms.
arXiv commentCIKM 2019
References in corpus (5)
- Efficient Estimation of Word Representations in Vector Space
- A Review of Relational Machine Learning for Knowledge Graphs
- Easing Embedding Learning by Comprehensive Transcription of Heterogeneous Information Networks
- Meta-Path Guided Embedding for Similarity Search in Large-Scale Heterogeneous Information Networks
- CARL: Content-Aware Representation Learning for Heterogeneous Networks