Joint Embedding of Meta-Path and Meta-Graph for Heterogeneous Information Networks
Authors:
- Lichao SunLSLichao Sun
- Lifang HeLHLifang He
- Zhipeng HuangZHZhipeng Huang
- Bokai CaoBCBokai Cao
- Congying XiaCXCongying Xia
- Xiaokai WeiXWXiaokai Wei
- Philip S. YuPYPhilip S. Yu
- 1 November 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 131-138
Abstract
Meta-graph is currently the most powerful tool for similarity search on heterogeneous information networks, where a meta-graph is a composition of meta-paths that captures the complex structural information. However, current relevance computing based on meta-graph only considers the complex structural information, but ignores its embedded meta-paths information. To address this problem, we proposeMEta-GrAph-based network embedding models, called MEGA and MEGA++, respectively. The MEGA model uses normalized relevance or similarity measures that are derived from a meta-graph and its embedded meta-paths between nodes simultaneously, and then leverages tensor decomposition method to perform node embedding. The MEGA++ further facilitates the use of coupled tensor-matrix decomposition method to obtain a joint embedding for nodes, which simultaneously considers the hidden relations of all meta information of a meta-graph. Extensive experiments on two real datasets demonstrate that MEGA and MEGA++ are more effective than state-of-the-art approaches.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Structured Matrix Problems from Tensors2016
- Heterogeneous Network Embedding via Deep Architectures2015
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of MultipliersIEEE Transactions on Signal Processing, 2015
- A Low-Rank Approximation-Based Transductive Support Tensor Machine for Semisupervised ClassificationIEEE Transactions on Image Processing, 2015
- DeepWalk2014
- Link prediction in heterogeneous data via generalized coupled tensor factorizationData Mining and Knowledge Discovery, 2013
- Distributed large-scale natural graph factorization2013
- Relational retrieval using a combination of path-constrained random walksMachine Learning, 2010