Metraipolis › archive › dc_85dd781cb9c8
High-Information-Density Knowledge Graph Retrieval Augmentation for Large Language Models (2026) · DOI 10.3390/electronics15204671
- Source
- Metraipolis archive
- Original
- https://doi.org/10.3390/electronics15204671
- License (as archived)
- CC-BY-4.0
- Archived
- 2026-10-17T23:01:21.242Z
- SHA-256 of the archived text
e325a870bf14831e2dc7166683c3767c3601bda324c10eaa7cedbb0f3493fbdd- Stable URL of this page
https://metraipolis.com/documento/dc_85dd781cb9c8
How to cite
High-Information-Density Knowledge Graph Retrieval Augmentation for Large Language Models (2026) · DOI 10.3390/electronics15204671 — Metraipolis archive, https://doi.org/10.3390/electronics15204671 (CC-BY-4.0); archived copy: https://metraipolis.com/documento/dc_85dd781cb9c8 (Metraipolis archive dc_85dd781cb9c8, sha256 e325a870bf14831e2dc7166683c3767c3601bda324c10eaa7cedbb0f3493fbdd)
BibTeX
@misc{dc85dd781cb9c8,
title = {High-Information-Density Knowledge Graph Retrieval Augmentation for Large Language Models (2026) · DOI 10.3390/electronics15204671},
howpublished = {Metraipolis archive},
url = {https://doi.org/10.3390/electronics15204671},
note = {License CC-BY-4.0; archived copy https://metraipolis.com/documento/dc_85dd781cb9c8; sha256 e325a870bf14831e2dc7166683c3767c3601bda324c10eaa7cedbb0f3493fbdd},
year = {2026}
}Archived text
Reproduced under CC-BY-4.0. Attribution: Metraipolis archive, https://doi.org/10.3390/electronics15204671. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Articolo recente con licenza aperta: scheda dai metadati Crossref (journal-article). Titolo: High-Information-Density Knowledge Graph Retrieval Augmentation for Large Language Models Autori: Zihao Zhou, Ganggang Yin, Zejian Lu, Feng Zhang, Wen Zhao Pubblicato: 2026-10-12 · in: Electronics · editore: MDPI AG DOI: https://doi.org/10.3390/electronics15204671 Licenza dell'articolo: CC-BY-4.0 Abstract (testo degli autori, CC-BY-4.0): Retrieval-Augmented Generation (RAG) mitigates hallucination and knowledge staleness in large language models (LLMs) by injecting external knowledge into the context window, yet its effectiveness is rigidly constrained by attention dilution and inference cost. Existing knowledge-graph-enhanced methods follow a sequential “retrieve-then-compress” paradigm in which retrieval and compression are optimized independently, preventing the compressor from rectifying redundancy and noise introduced during retrieval and making it difficult to achieve globally efficient information allocation under a limited token budget. To address this paradigm-level limitation, we propose LOKG (LLM-Oriented Knowledge Graph), a high-information-density knowledge graph retrieval augmentation framework that uses token-level information density maximization as a shared design objective across schema compression, subgraph retrieval, and triple encoding. LOKG comprises three synergistic modules: Semantic Compression of Ontology Schema (SCOS) offline merges semantically overlapping relations by fusing normalized mutual information, Jaccard co-occurrence, and TransE embedding similarity under a conditional-entropy-based adaptive threshold; Topology-Aware Indexing and Multi-granularity Retrieval (TAIMR) computes topology-aware multi-hop path scores using relation-aware graph attention and node information gain, then applies late query–answer semantic re-ranking in the E5 space; Information-Theoretic Triple Compression (ITTC) formulates granularity assignment as a multiple-choice knapsack problem, adaptively allocating compact, balanced, or verbose representations to candidate triples to maximize injected information under the budget constraint. Experiments on four KGQA evaluation settings from three benchmark families (CWQ, WebQSP, PathQuestion-2hop, and PathQuestion-3hop) demonstrate that under a single-LLM-call constraint, LOKG achieves a superior accuracy–efficiency trade-off. Ablation studies further verify the orthogonality and synergy of the three modules. LOKG offers a transparent, auditable, and low-cost solution for knowledge graph retrieval-augmented generation under token budget constraints. Fonte: https://api.crossref.org/works/10.3390%2Felectronics15204671 — metadati Crossref, consultati il 2026-10-17. Interrogazione: «knowledge graph construction language models».