Multi-View Learning-Based Fast Edge Embedding for Heterogeneous Graphs

Canwei Liu, Xingye Deng (), Tingqin He, Lei Chen, Guangyang Deng and Yuanyu Hu
Additional contact information
Canwei Liu: School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201, China
Xingye Deng: School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201, China
Tingqin He: School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201, China
Lei Chen: School of Information and Electrical Engineering, Hunan University of Science and Technology, Xiangtan 411201, China
Guangyang Deng: School of Information and Electrical Engineering, Hunan University of Science and Technology, Xiangtan 411201, China
Yuanyu Hu: School of Information and Electrical Engineering, Hunan University of Science and Technology, Xiangtan 411201, China

Mathematics, 2023, vol. 11, issue 13, 1-23

Abstract: Edge embedding is a technique for constructing low-dimensional feature vectors of edges in heterogeneous graphs, which are also called heterogeneous information networks (HINs). However, edge embedding research is still in its early stages, and few well-developed models exist. Moreover, existing models often learn features on the edge graph, which is much larger than the original network, resulting in slower speed and inaccurate performance. To address these issues, a multi-view learning-based fast edge embedding model is developed for HINs in this paper, called MVFEE. Based on the “divide and conquer” strategy, our model divides the global feature learning into multiple separate local intra-view features learning and inter-view features learning processes. More specifically, each vertex type in the edge graph (each edge type in HIN) is first treated as a view, and a private skip-gram model is used to rapidly learn the intra-view features. Then, a cross-view learning strategy is designed to further learn the inter-view features between two views. Finally, a multi-head attention mechanism is used to aggregate these local features to generate accurate global features of each edge. Extensive experiments on four datasets and three network analysis tasks show the advantages of our model.

Keywords: divide and conquer; edge embedding; edge graph; heterogeneous graph; multi-view learning (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/13/2974/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/13/2974/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:13:p:2974-:d:1186156

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().