The reviewed record of science sign in
Pith

arxiv: 2311.11368 · v1 · pith:WWXUHWBD · submitted 2023-11-19 · cs.LG · cs.SI· stat.ML

Self-Supervised Pretraining for Heterogeneous Hypergraph Neural Networks

Reviewed by Pithpith:WWXUHWBDopen to challenge →

classification cs.LG cs.SIstat.ML
keywords pretrainingself-supervisedtasksentitieshypergnnhypergraphsphhvarious
0
0 comments X
read the original abstract

Recently, pretraining methods for the Graph Neural Networks (GNNs) have been successful at learning effective representations from unlabeled graph data. However, most of these methods rely on pairwise relations in the graph and do not capture the underling higher-order relations between entities. Hypergraphs are versatile and expressive structures that can effectively model higher-order relationships among entities in the data. Despite the efforts to adapt GNNs to hypergraphs (HyperGNN), there are currently no fully self-supervised pretraining methods for HyperGNN on heterogeneous hypergraphs. In this paper, we present SPHH, a novel self-supervised pretraining framework for heterogeneous HyperGNNs. Our method is able to effectively capture higher-order relations among entities in the data in a self-supervised manner. SPHH is consist of two self-supervised pretraining tasks that aim to simultaneously learn both local and global representations of the entities in the hypergraph by using informative representations derived from the hypergraph structure. Overall, our work presents a significant advancement in the field of self-supervised pretraining of HyperGNNs, and has the potential to improve the performance of various graph-based downstream tasks such as node classification and link prediction tasks which are mapped to hypergraph configuration. Our experiments on two real-world benchmarks using four different HyperGNN models show that our proposed SPHH framework consistently outperforms state-of-the-art baselines in various downstream tasks. The results demonstrate that SPHH is able to improve the performance of various HyperGNN models in various downstream tasks, regardless of their architecture or complexity, which highlights the robustness of our framework.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. HYPER: A Foundation Model for Inductive Link Prediction with Knowledge Hypergraphs

    cs.LG 2025-06 unverdicted novelty 7.0

    HYPER is a foundation model for inductive link prediction on knowledge hypergraphs that generalizes to novel entities and novel relations by encoding entities with their positions in hyperedges of varying arities.