Deep reasoning of large models based on knowledge graph

Although Large Language Models (LLMs) have achieved significant success in various tasks, they often struggle with hallucination issues in scenarios requiring deep reasoning. Incorporating external knowledge into LLM reasoning can alleviate some of these issues. This paper proposes an efficient graph search method that integrates knowledge graphs. A knowledge graph is firstly constructed from the original document. This graph is then partitioned into multiple relevant communities using a community detection algorithm, and natural language summaries for each community are generated using an LLM. During the search phase, the LLM performs beam search on the knowledge graph, iteratively exploring multiple potential reasoning paths on the graph until it determines that it can answer the question based on the current reasoning path. Experiments demonstrate that our search method has lower computational costs and better generalizability, outperforming even large LLMs like GPT-4 in certain vertical domains.

Authors

Institutions

Publication Details

Published
2025-02-13
DOI
https://doi.org/10.1117/12.3057811
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deep reasoning of large models based on knowledge graph

Chenghao Cao, Zhenlong Du, Xiaoli Li
Advanced Graph Neural Networks
article

Deep reasoning of large models based on knowledge graph

Chenghao Cao, Zhenlong Du, Xiaoli Li
article en

Abstract

Although Large Language Models (LLMs) have achieved significant success in various tasks, they often struggle with hallucination issues in scenarios requiring deep reasoning. Incorporating external knowledge into LLM reasoning can alleviate some of these issues. This paper proposes an efficient graph search method that integrates knowledge graphs. A knowledge graph is firstly constructed from the original document. This graph is then partitioned into multiple relevant communities using a community detection algorithm, and natural language summaries for each community are generated using an LLM. During the search phase, the LLM performs beam search on the knowledge graph, iteratively exploring multiple potential reasoning paths on the graph until it determines that it can answer the question based on the current reasoning path. Experiments demonstrate that our search method has lower computational costs and better generalizability, outperforming even large LLMs like GPT-4 in certain vertical domains.

Nanjing Tech University (CN)
Openalex Percentile: Top 99%
Advanced Graph Neural Networks
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.