Efficient LLM-Based Subgraph Retrieval for Multi-Hop Knowledge Base Question Answering
IEEE Transactions on Knowledge and Data Engineering · 2026-06 · 38 (6) · 3511-3523
DOI: 10.1109/tkde.2026.3679080 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Knowledge and Data Engineering, 2026-06. Verfasst von Duanyang Yuan und 5 weiteren Autor:innen. Die Arbeit nennt 67 Literaturangaben. Gefördert von: Huxiang Young Talents in Science and Technology Innovation Project, Hunan Provincial Innovation Foundation For Postgraduate.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Huxiang Young Talents in Science and Technology Innovation Project
- Hunan Provincial Innovation Foundation For Postgraduate
Zitieren
APA
Yuan, D., Zhou, S., Chen, X., Chen, H., Liang, K., & Huang, J. (2026). Efficient LLM-Based Subgraph Retrieval for Multi-Hop Knowledge Base Question Answering. IEEE Transactions on Knowledge and Data Engineering, 38(6), 3511-3523. https://doi.org/10.1109/tkde.2026.3679080
Vancouver
Yuan D, Zhou S, Chen X, Chen H, Liang K, Huang J. Efficient LLM-Based Subgraph Retrieval for Multi-Hop Knowledge Base Question Answering. IEEE Transactions on Knowledge and Data Engineering. 2026;38(6):3511-3523. doi:10.1109/tkde.2026.3679080
BibTeX
@article{Yuan2026,
author = {Yuan, Duanyang and Zhou, Sihang and Chen, Xiaoshu and Chen, Haoyuan and Liang, Ke and Huang, Jian},
title = {Efficient LLM-Based Subgraph Retrieval for Multi-Hop Knowledge Base Question Answering},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {2026},
volume = {38},
number = {6},
pages = {3511--3523},
doi = {10.1109/tkde.2026.3679080}
}
EUVIMED