Browse State-of-the-Art › Hyperedge Prediction
Hyperedge Prediction
10 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Hyperlink/hyperedge prediction, targets to find missing hyperedges in a hypergraph.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 20 · with a code link: 10 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 20 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 20 of 20, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
27 Oct 2021 2 repositories listed Syntology official: harvested, nothing ran · 0 ran · 1 unverified (of 1 harvested sample) · 1 pointer-only (licence)We present a generalization of Transformers to any-order permutation invariant data (sets, graphs, and hypergraphs).
-
8 May 2025 1 repository listedHere, we demonstrate how to utilize those interconnections between multiple hypergraphs to synthesize integrated information from multiple higher-order systems, thereby enhancing understanding of underlying structures.
-
1 Dec 2023 1 repository listedIn this study, we present SSF, an innovative hyperlink prediction methodology based on Subgraph Structural Features.
-
7 Nov 2023 1 repository listedMany networked datasets with units interacting in groups of two or more, encoded with hypergraphs, are accompanied by extra information about nodes, such as the role of an individual in a workplace.
-
20 Oct 2023 1 repository listedOn the other hand, pretraining and finetuning on the same dataset leads to a high risk of overfitting.
-
11 Sep 2023 1 repository listedTo tackle both challenges together, in this paper, we propose a novel hyperedge prediction framework (CASH) that employs (1) context-aware node aggregation to precisely capture complex relations among nodes in each…
-
19 Jun 2023 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result (of 2 harvested samples) · 2 pointer-only (licence)Our evaluation on 10 hypergraph benchmark datasets shows that CAT-Walk attains outstanding performance on temporal hyperedge prediction benchmarks in both inductive and transductive settings.
-
13 Apr 2022 1 repository listedSince it is prohibitive to use all of them as negative examples for model training, it is inevitable to sample a very small portion of them, and to this end, heuristic sampling schemes have been employed.
-
12 Apr 2022 1 repository listedHypergraphs, encoding structured interactions among any number of system units, have recently proven a successful tool to describe many real-world biological and social networks.
-
6 Feb 2021 1 repository listedThis is further used to propose a hyperedge prediction algorithm.
-
HyGEN: Regularizing Negative Hyperedge Generation for Accurate Hyperedge Prediction9 Feb 2025 0 repositories listedHyperedge prediction is a fundamental task to predict future high-order relations based on the observed network structure.
-
HyperQuery: Beyond Binary Link Prediction13 Jan 2025 0 repositories listedGroups with complex set intersection relations are a natural way to model a wide array of data, from the formation of social groups to the complex protein interactions which form the basis of biological life.
-
Scalable and Effective Negative Sample Generation for Hyperedge Prediction19 Nov 2024 0 repositories listedHyperedge prediction is crucial in hypergraph analysis for understanding complex multi-entity interactions in various web-based applications, including social networks and e-commerce systems.
-
A generalizable framework for unlocking missing reactions in genome-scale metabolic networks using deep learning20 Sep 2024 0 repositories listedIncomplete knowledge of metabolic processes hinders the accuracy of GEnome-scale Metabolic models (GEMs), which in turn impedes advancements in systems biology and metabolic engineering.
-
Training-Free Message Passing for Learning on Hypergraphs8 Feb 2024 0 repositories listedHypergraphs are crucial for modelling higher-order interactions in real-world data.
-
Improving Graph Neural Networks on Multi-node Tasks with Labeling Tricks20 Apr 2023 0 repositories listedIn this paper, we provide a theory of using graph neural networks (GNNs) for multi-node representation learning, where we are interested in learning a representation for a set of more than one node such as a link.
-
A Hypergraph Neural Network Framework for Learning Hyperedge-Dependent Node Embeddings28 Dec 2022 0 repositories listedIn this work, we introduce a hypergraph representation learning framework called Hypergraph Neural Networks (HNN) that jointly learns hyperedge embeddings along with a set of hyperedge-dependent embeddings for each node…
-
Dynamic Representation Learning with Temporal Point Processes for Higher-Order Interaction Forecasting19 Dec 2021 0 repositories listedThe explosion of digital information and the growing involvement of people in social networks led to enormous research activity to develop methods that can extract meaningful information from interaction data.
-
Principled Hyperedge Prediction with Structural Spectral Features and Neural Networks8 Jun 2021 0 repositories listedHypergraph offers a framework to depict the multilateral relationships in real-world complex data.
-
How Much and When Do We Need Higher-order Information in Hypergraphs? A Case Study on Hyperedge Prediction30 Jan 2020 0 repositories listedHypergraphs provide a natural way of representing group relations, whose complexity motivates an extensive array of prior work to adopt some form of abstraction and simplification of higher-order interactions.
Syntology lines on 2 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections