LLM-Reflex-GeoKG: A reflexion-enhanced LLM framework for automated geographic knowledge graph construction

The automated construction of high-quality, domain-specific Geographic Knowledge Graphs (GeoKGs) is pivotal for intelligent applications, such as river network modelling, digital watershed management, and cultural heritage conservation in river basins. However, this task faces a core challenge of inaccurate and incomplete knowledge extraction. While Large Language Models (LLMs) offer a new paradigm, their direct application is often undermined by inherent hallucinations and a limited grasp of complex geospatial semantics. To address these challenges, this study proposes and validates a novel framework, LLM-Reflex-GeoKG, which integrates a Reflexion-style self-reflection loop with a collaborative dual-LLM generator-critic scheme and a multi-stage extraction strategy for GeoKG construction.Experiments on data from the Yangtze River Delta river network demonstrate that our framework achieves F1 scores of 0.898 and 0.823 on geographic entity recognition and relation extraction tasks, significantly outperforming baseline systems. This research confirms that our framework improves both the accuracy and completeness of automated knowledge acquisition while reducing reliance on extensive manual annotation, offering a practical paradigm for building reliable, domain-specific GeoKGs.

Authors

Institutions

Publication Details

Journal
PLoS ONE
Published
2026-04-02
DOI
https://doi.org/10.1371/journal.pone.0344565
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

LLM-Reflex-GeoKG: A reflexion-enhanced LLM framework for automated geographic knowledge graph construction

Minyi Liao, Xiangfei Yang, Zongjun Wei, Mengting Cao et al.
PLoS ONE
Advanced Graph Neural Networks
article

LLM-Reflex-GeoKG: A reflexion-enhanced LLM framework for automated geographic knowledge graph construction

Minyi Liao, Xiangfei Yang, Zongjun Wei, Mengting Cao, Youheng Xu, Gang Chen
article en

Abstract

The automated construction of high-quality, domain-specific Geographic Knowledge Graphs (GeoKGs) is pivotal for intelligent applications, such as river network modelling, digital watershed management, and cultural heritage conservation in river basins. However, this task faces a core challenge of inaccurate and incomplete knowledge extraction. While Large Language Models (LLMs) offer a new paradigm, their direct application is often undermined by inherent hallucinations and a limited grasp of complex geospatial semantics. To address these challenges, this study proposes and validates a novel framework, LLM-Reflex-GeoKG, which integrates a Reflexion-style self-reflection loop with a collaborative dual-LLM generator-critic scheme and a multi-stage extraction strategy for GeoKG construction.Experiments on data from the Yangtze River Delta river network demonstrate that our framework achieves F1 scores of 0.898 and 0.823 on geographic entity recognition and relation extraction tasks, significantly outperforming baseline systems. This research confirms that our framework improves both the accuracy and completeness of automated knowledge acquisition while reducing reliance on extensive manual annotation, offering a practical paradigm for building reliable, domain-specific GeoKGs.

PLoS ONEVol. 21(4)
Fondazione GraphiTech (IT), Nanjing University (CN)
National Natural Science Foundation of China
Sustainable cities and communities
Openalex Percentile: Top 32%
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.