Effective and Reliable Domain-Specific Knowledge Question Answering

Large language models (LLMs) serve as powerful knowledge bases, capable of embedding knowledge from text into model parameters. However, the widespread issue of hallucination and opaque black-box processes restrict their broader application in professional sectors that place high demands on safety and predictability. Conversely, knowledge graphs provide inherent superiority in the authenticity and interpretability in question answering sessions. However, building a knowledge graph in specialized fields and conduct question answering over the knowledge graph are both nontrivial problems. This paper introduces an efficient knowledge graph question answering (KGQA) approach tailored to customized domain-specific knowledge graphs. Our “extract-then-bind” KGQA method leverages the in-context learning capabilities of the LLM to extract mention and relation proposals from the query, which are then matched with nodes and edges in the knowledge graph. Experimental results demonstrate the effectiveness of our approach in a question answering task using automotive user manuals. Notably, the knowledge graph was created through an automated process. By combining this innovative KGQA technique with its corresponding knowledge graph construction method, this paper proposes an effective and reliable system for addressing domain-specific knowledge question answering. This integrated solution guarantees authenticity and traceability in question answering while significantly reducing the need for manual labour.

Authors

Institutions

Publication Details

Published
2024-10-11
DOI
https://doi.org/10.1109/icebe62490.2024.00044
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Effective and Reliable Domain-Specific Knowledge Question Answering

Yong Chen, Jun Xiao, Zhonglin Jiang, Yanli Ge et al.
Topic Modeling
article

Effective and Reliable Domain-Specific Knowledge Question Answering

Yong Chen, Jun Xiao, Zhonglin Jiang, Yanli Ge, Yunfei Fang
article en

Abstract

Large language models (LLMs) serve as powerful knowledge bases, capable of embedding knowledge from text into model parameters. However, the widespread issue of hallucination and opaque black-box processes restrict their broader application in professional sectors that place high demands on safety and predictability. Conversely, knowledge graphs provide inherent superiority in the authenticity and interpretability in question answering sessions. However, building a knowledge graph in specialized fields and conduct question answering over the knowledge graph are both nontrivial problems. This paper introduces an efficient knowledge graph question answering (KGQA) approach tailored to customized domain-specific knowledge graphs. Our “extract-then-bind” KGQA method leverages the in-context learning capabilities of the LLM to extract mention and relation proposals from the query, which are then matched with nodes and edges in the knowledge graph. Experimental results demonstrate the effectiveness of our approach in a question answering task using automotive user manuals. Notably, the knowledge graph was created through an automated process. By combining this innovative KGQA technique with its corresponding knowledge graph construction method, this paper proposes an effective and reliable system for addressing domain-specific knowledge question answering. This integrated solution guarantees authenticity and traceability in question answering while significantly reducing the need for manual labour.

Zhejiang University of Science and Technology (CN), Chery Automobile (China) (CN), Geely (China) (CN)
Openalex Percentile: Top 79%
Topic Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.