Open access

A hierarchical attributed graph RAG framework for biomedical literature retrieval

Maneeha Rani B. K. Mishra Dhavalkumar Thakker Javed Ali Khan

Aug 2026 · Machine Learning: Science and Technology · 0 citations

TL;DR

The results show that effective hierarchical Graph RAG depends not only on graph augmentation, but on constructing, navigating, and weighting the hierarchy, while retrieval quality remains sensitive to clustering and weighting choices.

Abstract

Despite rapid progress in retrieval-augmented generation (RAG), existing systems still struggle to retrieve both fine-grained entity-level evidence and higher-level abstract knowledge from biomedical literature. Graph-based RAG offers a promising alternative to flat retrieval, and hierarchical Graph RAG extends this idea by enabling coarse-to-fine retrieval across multiple levels of abstraction. Its effectiveness, however, depends on hierarchy construction choices, uneven community connectivity, and query-dependent layer choice. These challenges are particularly important in literature-derived biomedical graphs, where the hierarchy is constructed automatically from documents rather than specified in advance. We introduce HAGRAG, a hierarchical attributed Graph RAG framework for PubMed-derived diabetes literature. HAGRAG constructs multi-level attributed communities, summarizes them across layers, indexes them using hierarchical navigable similarity search, and supports layer-aware filtering during retrieval. It further evaluates alternative community detection algorithms and layer-weighting strategies to determine how hierarchy design affects retrieval behaviour. Across comparisons with baseline systems, HAGRAG achieves the strongest overall performance, including accuracy of 0.80, relevancy of 1.00, recall of 0.54, and mean semantic similarity of 0.65. Answer quality is further assessed through NLI-based entailment checks and independent diabetes-clinician validation. The results show that Leiden produces the most coherent hierarchy, while retrieval quality remains sensitive to clustering and weighting choices. Overall, the findings show that effective hierarchical Graph RAG depends not only on graph augmentation, but on constructing, navigating, and weighting the hierarchy.

DOI Semantic Scholar

Read PDF

Similar papers

Aug 2026

CGX: OCR-enhanced knowledge graph retrieval for explainable heart failure analysis

Initial experiments on heart-failure-focused clinical question answering show that CGX improves evidence retrieval quality and perceived answer reliability over conventional retrieval methods, while reducing total graph construction time by 69.7% under the same input corpus and hardware setting.

Dat Nguyen, Anh N. Le, Binh T. D. Trinh et al. · Journal of Biomedical Inform... · 0 citations

Preprint Aug 2026

VDGR-RAG: Vectors, Directories, Graphs, and Reflection Are All You Need for Unified Reasoning over Hierarchical Enterprise Knowledge

Experimental results demonstrate that the VDGR-RAG method significantly outperforms a variety of RAG baselines in terms of both knowledge retrieval recall and QA accuracy.

Wenqi Chen, Haofei Yang, Rui Yang et al. · 0 citations

Jul 2026

NGM-RAG: Neural Graph Matching based Retrieval-Augmented Generation

NGM-RAG is introduced, a novel framework that leverages graph structures to effectively capture and utilize relational knowledge for improved retrieval and answer generation and proposes a neural graph matching approach that combines text-based matching with Graph Neural Networks (GNNs).

Guo Chen, Ziwen Li, Mao Zheng et al. · arXiv.org · 0 citations

Conference Jul 2026

Ontology-Free Biomedical Knowledge Graph Induction (OF-Bio-KG)

Adapting large language models (LLMs) to new domains using techniques like pre-training or fine-tuning can be computationally intensive. This challenge has motivated researchers and practitioners to explore alternative strategies, such as Retrieval-based augmentation mechanisms, to reduce training cost while preserving model adaptability. These mechanisms enable LLMs to generate responses grounded in external and previously unseen data. Among these approaches, RetrievalAugmented Generation (RAG) is the widely adopted due to its relatively low computational overhead. However, conventional RAG pipelines exhibit some limitations, including weak semantic coherence across retrieved contexts, limited structural reasoning capability, and the absence of explicit relational representations. To overcome these limitations, recent research has shifted toward the integration of Knowledge Graphs (KGs), which provide structured semantic representations and explicit relational modeling. KG-based approaches looks promising but the typically depend on manually designed ontologies, resulting in scalability constraints and domain adaptation challenges. To address these limitations, we propose OF-BIO-KG, a framework for automated, ontology-free knowledge graph construction. Our approach begins by projecting domain data into a vector database to identify semantically coherent clusters. An LLM then labels these clusters as conceptual nodes and infers both hierarchical and cross-cluster relationships. These nodes and links are persisted in a graph database. By eliminating the need for predefined schemas, our framework offers a scalable, computationally efficient solution for domain-specific LLM adaptation.

Ahlem Ben Younes, Baha Eddine Kalai, Laila Ben Ayed et al. · Annual International Compute... · 0 citations

Jul 2026

PAGE-RAG: Evidence-Grounded Adaptive Graph Retrieval for Long-Document Question Answering

Experiments demonstrate that PAGE-RAG achieves competitive answer quality while improving retrieval efficiency and knowledge reliability, highlighting the importance of projection-aware graph modeling, adaptive retrieval, and explicit knowledge boundary control for trustworthy GraphRAG systems.

Xingyu Chen, Junxiu An, Jun Guo et al. · arXiv.org · 1 citation

Jul 2026

GLM-RAG: Graph Language Models for Graph-Based Retrieval-Augmented Generation

This work introduces a GLM-based retriever and investigates the comparative strengths of GLM-based, GNN-based, and traditional vector-search-based retrievers in single- and multi-hop RAG settings, and suggests that finetuned GLM retrievers generalize better out of domain.

Maya Arseven, Anette Frank, Béni Egressy et al. · arXiv.org · 0 citations