Existing Graph RAG (GraphRAG) methods struggle because they represent knowledge using only binary relations (linking two entities), missing complex real-world connections involving more than two entities.
This paper introduces HyperGraphRAG, which uses hypergraphs to model these multi-entity (n-ary) relationships directly using hyperedges, improving knowledge representation for LLMs.
HyperGraphRAG shows better accuracy, achieving higher Context Recall (e.g., 60.34 overall) and Answer Relevance (e.g., 85.15 in Medicine) than previous methods.
π Hypergraphs intrinsically model multi-entity facts, overcoming the information loss in binary graph representations.
π Dual vector retrieval (entities, hyperedges) enables precise fact finding and contextual expansion simultaneously.
π Capturing richer relations via hypergraphs improves accuracy, balancing slightly increased construction time and cost.
----------
Methods Explored in this Paper π§:
β LLMs extract n-ary relational facts (hyperedges connecting multiple entities) from text to construct a knowledge hypergraph.
β A bipartite graph structure stores the hypergraph efficiently in standard graph databases.
β Vector embeddings represent both entities and hyperedges for semantic retrieval using similarity search.
β A retrieval strategy first finds relevant entities based on the query, then expands to find connected hyperedges and related entities.
β Generation combines retrieved hypergraph facts with traditional chunk-based retrieved text for a comprehensive final answer.
----------------------------
Paper - arxiv. org/abs/2503.21322
Paper Title: "HyperGraphRAG: RAG with Hypergraph-Structured Knowledge Representation"