REVIEW 4 cited by
Knowledge Hypergraphs: Prediction Beyond Binary Relations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Knowledge Hypergraphs: Prediction Beyond Binary Relations
read the original abstract
Knowledge graphs store facts using relations between two entities. In this work, we address the question of link prediction in knowledge hypergraphs where relations are defined on any number of entities. While techniques exist (such as reification) that convert non-binary relations into binary ones, we show that current embedding-based methods for knowledge graph completion do not work well out of the box for knowledge graphs obtained through these techniques. To overcome this, we introduce HSimplE and HypE, two embedding-based methods that work directly with knowledge hypergraphs. In both models, the prediction is a function of the relation embedding, the entity embeddings and their corresponding positions in the relation. We also develop public datasets, benchmarks and baselines for hypergraph prediction and show experimentally that the proposed models are more effective than the baselines.
Forward citations
Cited by 4 Pith papers
-
Knowledge Is Not Static: Order-Aware Hypergraph RAG for Language Models
OKH-RAG represents knowledge as ordered hyperedges and retrieves coherent interaction sequences via a learned transition model, outperforming permutation-invariant RAG baselines on order-sensitive QA tasks.
-
Hyper-KGGen: A Skill-Driven Knowledge Extractor for High-Quality Knowledge Hypergraph Generation
Hyper-KGGen improves n-ary knowledge hypergraph extraction by learning a reusable skill library from stable, unstable, and missed LLM predictions, and introduces the HyperDocRED benchmark.
-
Representing Higher-Order Networks: A Survey of Graph-Based Frameworks
A comprehensive survey of graph-based frameworks for higher-order networks, covering foundational concepts, extensions, and newly introduced formalisms with emphasis on structural principles and applications.
-
Representing Higher-Order Networks: A Survey of Graph-Based Frameworks
A comprehensive survey of graph-based formalisms for higher-order networks including multiway, hierarchical, temporal, multilayer, recursive, and tensor-based models.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.