Self-Supervised Graph Neural Networks for Enhanced Feature Extraction in Heterogeneous Information Networks

This paper explores the applications and challenges of graph neural networks (GNNs) in processing complex graph data brought about by the rapid development of the Internet. Given the heterogeneity and redundancy problems that graph data often have, traditional GNN methods may be overly dependent on the initial structure and attribute information of the graph, which limits their ability to accurately simulate more complex relationships and patterns in the graph. Therefore, this study proposes a graph neural network model under a self-supervised learning framework, which can flexibly combine different types of additional information of the attribute graph and its nodes, so as to better mine the deep features in the graph data. By introducing a self-supervisory mechanism, it is expected to improve the adaptability of existing models to the diversity and complexity of graph data and improve the overall performance of the model.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icmlca63499.2024.10753970
Citations
50
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
17.37
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Self-Supervised Graph Neural Networks for Enhanced Feature Extraction in Heterogeneous Information Networks

Xin Huang, Yan Xu, W.Y. Liu, Yue Liu et al.
50 citations
Neural Networks and Applications
17.37
article

Self-Supervised Graph Neural Networks for Enhanced Feature Extraction in Heterogeneous Information Networks

Xin Huang, Yan Xu, W.Y. Liu, Yue Liu, Xin Zhang, Jianjun Wei
article en
50 citations

Abstract

This paper explores the applications and challenges of graph neural networks (GNNs) in processing complex graph data brought about by the rapid development of the Internet. Given the heterogeneity and redundancy problems that graph data often have, traditional GNN methods may be overly dependent on the initial structure and attribute information of the graph, which limits their ability to accurately simulate more complex relationships and patterns in the graph. Therefore, this study proposes a graph neural network model under a self-supervised learning framework, which can flexibly combine different types of additional information of the attribute graph and its nodes, so as to better mine the deep features in the graph data. By introducing a self-supervisory mechanism, it is expected to improve the adaptability of existing models to the diversity and complexity of graph data and improve the overall performance of the model.

Fordham University (US), Trine University (US), Washington University in St. Louis (US), Phoenix (United States) (US), University of Virginia (US), Seattle University (US)
Openalex Percentile: Top 1%
Neural Networks and Applications
17.37
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.