An Efficient Multi-View Heterogeneous Hypergraph Convolutional Network for Heterogeneous Information Network Representation Learning

Heterogeneous hypergraph neural networks are powerful tools to capture complex correlations among various nodes in Heterogeneous Information Networks (HINs). Despite satisfied performances of them, they are still plagued by the following problems: 1) They cannot capture the correlations in structural and semantic view at once, leading to topological information loss. 2) Due to the number of nodes being greater than the number of node types, node-level self-attention they used causes massive parameters and leads to high time consumption. 3) Interactions in meta-paths may be redundant, resulting in the correlations bias. To address the three issues, we propose an efficient <u>M</u>ulti-<u>V</u>iew <u>H</u>eterogeneous <u>H</u>yper<u>g</u>raph <u>C</u>onvolutional <u>N</u>etwork (MVH <inline-formula><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> GCN). It first constructs relational and semantic hypergraphs based on different types of edges and meta-paths respectively, to represent the complex correlations in structural view and semantic view. Meanwhile, the clean semantic hypergraphs are generated by structure learning network to avoid redundancy. Then, an efficient hypergraph convolutional network is designed to learn node embeddings. By doing so, correlations in the two views are captured. Finally, the learned node embeddings from two views are aggregated via a gated embedding fusion module for downstream tasks. Experiment results demonstrate that MVH <inline-formula><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> GCN is effective and efficient.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Big Data
Published
2024-08-13
DOI
https://doi.org/10.1109/tbdata.2024.3442549
Citations
1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Multi-View Heterogeneous Hypergraph Convolutional Network for Heterogeneous Information Network Representation Learning

Yong Zhou, Senzhang Wang, Guan Yuan, Rui Bing et al.
1 citations
IEEE Transactions on Big Data
Advanced Graph Neural Networks
0.35
article

An Efficient Multi-View Heterogeneous Hypergraph Convolutional Network for Heterogeneous Information Network Representation Learning

Yong Zhou, Senzhang Wang, Guan Yuan, Rui Bing, Bohan Li, Yanmei Zhang
article en
1 citations

Abstract

Heterogeneous hypergraph neural networks are powerful tools to capture complex correlations among various nodes in Heterogeneous Information Networks (HINs). Despite satisfied performances of them, they are still plagued by the following problems: 1) They cannot capture the correlations in structural and semantic view at once, leading to topological information loss. 2) Due to the number of nodes being greater than the number of node types, node-level self-attention they used causes massive parameters and leads to high time consumption. 3) Interactions in meta-paths may be redundant, resulting in the correlations bias. To address the three issues, we propose an efficient <u>M</u>ulti-<u>V</u>iew <u>H</u>eterogeneous <u>H</u>yper<u>g</u>raph <u>C</u>onvolutional <u>N</u>etwork (MVH <inline-formula><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> GCN). It first constructs relational and semantic hypergraphs based on different types of edges and meta-paths respectively, to represent the complex correlations in structural view and semantic view. Meanwhile, the clean semantic hypergraphs are generated by structure learning network to avoid redundancy. Then, an efficient hypergraph convolutional network is designed to learn node embeddings. By doing so, correlations in the two views are captured. Finally, the learned node embeddings from two views are aggregated via a gated embedding fusion module for downstream tasks. Experiment results demonstrate that MVH <inline-formula><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> GCN is effective and efficient.

IEEE Transactions on Big DataVol. 11(3)
Central South University (CN), China University of Mining and Technology (CN), Nanjing University of Aeronautics and Astronautics (CN)
Openalex Percentile: Top 35%
Advanced Graph Neural Networks
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.