mg2vec: Learning relationship-preserving heterogeneous graph representations via metagraph embedding

• Main Authors: ZHANG, Wentao, FANG, Yuan, LIU, Zemin, WU, Min, ZHANG, Xinming
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2022
• Subjects: heterogeneous information networks; network embedding; relationship mining; Databases and Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/5128; https://ink.library.smu.edu.sg/context/sis_research/article/6131/viewcontent/TKDE20_mg2vec.pdf
• Institution: Singapore Management University

Given that heterogeneous information networks (HIN) encompass nodes and edges belonging to different semantic types, they can model complex data in real-world scenarios. Thus, HIN embedding has received increasing attention, which aims to learn node representations in a low-dimensional space, in order to preserve the structural and semantic information on the HIN. In this regard, metagraphs, which model common and recurring patterns on HINs, emerge as a powerful tool to capture semantic-rich and often latent relationships on HINs. Although metagraphs have been employed to address several specific data mining tasks, they have not been thoroughly explored for the more general HIN embedding. In this paper, we leverage metagraphs to learn relationship-preserving HIN embedding in a self-supervised setting, to support various relationship mining tasks. In particular, we observe that most of the current approaches often under-utilize metagraphs, which are only applied in a pre-processing step and do not actively guide representation learning afterwards. Thus, we propose the novel framework of mg2vec, which learns the embeddings for metagraphs and nodes jointly. That is, metagraphs actively participates in the learning process by mapping themselves to the same embedding space as the nodes do. Moreover, metagraphs guide the learning through both first- and second-order constraints on node embeddings, to model not only latent relationships between a pair of nodes, but also individual preferences of each node. Finally, we conduct extensive experiments on three public datasets. Results show that mg2vec significantly outperforms a suite of state-of-the-art baselines in relationship mining tasks including relationship prediction, search and visualization.