Supervised Hypergraph Reconstruction
Yanbang Wang, Jon Kleinberg

TL;DR
This paper introduces a supervised hypergraph reconstruction method that accurately reconstructs hypergraphs from their projections, addressing a common issue in complex systems analysis and outperforming existing baselines.
Contribution
The paper formulates the novel task of supervised hypergraph reconstruction and proposes an effective framework with sampling and classification modules, validated by extensive experiments.
Findings
Outperforms all baselines by an order of magnitude in accuracy.
Effectively narrows search space for hyperedge candidates.
Validates approach with extensive experiments on hard datasets.
Abstract
We study an issue commonly seen with graph data analysis: many real-world complex systems involving high-order interactions are best encoded by hypergraphs; however, their datasets often end up being published or studied only in the form of their projections (with dyadic edges). To understand this issue, we first establish a theoretical framework to characterize this issue's implications and worst-case scenarios. The analysis motivates our formulation of the new task, supervised hypergraph reconstruction: reconstructing a real-world hypergraph from its projected graph, with the help of some existing knowledge of the application domain. To reconstruct hypergraph data, we start by analyzing hyperedge distributions in the projection, based on which we create a framework containing two modules: (1) to handle the enormous search space of potential hyperedges, we design a sampling strategy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Data Visualization and Analytics · Advanced Graph Neural Networks
