Skip to content

Automated Tree Knowledge Graph Construction using Ontology Expansion and Retrieval from Vietnamese History Textbooks

Sep 2026 · 0 citations · 26 references
Computer Science

TL;DR

This paper constructs the tree knowledge graph from Vietnamese high school History textbooks to produce 750 nodes and 4,341 semantic edges with controlled ontology growth from 40 to 41 types.

Abstract

Hierarchical Knowledge graph (KG)-based retrieval augmented generation (RAG) has emerged as a powerful approach for supporting large language models with structured knowledge. However, there are primary challenges: (i) the lack of methods for automatic KG construction using ontology expansion for low-resource languages such as Vietnamese, (ii) the absence of systematic evaluation for knowledge retrieval strategies leveraging the hierarchical structures. In this paper, we propose an end-to-end pipeline for KG construction and retrieval strategies evaluation. In the KG construction, we employ a three-phase hybrid relation extraction pipeline: intra-batch deduplication via Union-Find, approximate cross-batch search, and LLM extraction with a centroid filter that reduces prompts combined with a five-step dual-LLM validator to prevent bloated ontology. A two-tier architecture consists of unmergeable structural nodes to preserve the document structure and mergeable content nodes. The retrieval evaluation consists of three graph traversal strategies: Top-Down, Horizontal, and Bottom-Up, which are evaluated on a synthetically generated benchmark of 1,210 Vietnamese queries from 109 subgraphs, categorized by five query directions. In this paper, we construct the tree knowledge graph from Vietnamese high school History textbooks (nearly 400 pages) to produce 750 nodes and 4,341 semantic edges with controlled ontology growth from 40 to 41 types. Among experimental graph traversal strategies, the Top-Down strategy with structure surpasses the vector baseline by 4.7 percentage points in NDCG@10. As a result, tree-structural information provides valuable information beyond flat cosine similarity but degrades performance when the query does not require structural context.

View source

Similar papers

#natural language process... Preprint Sep 2026

LLM-Guided Ontology-Driven Knowledge Graph Construction from Unstructured Text

Ontology-driven knowledge graph construction from industrial text remains challenging due to the domain specificity of documents, the scarcity of annotated resources, and the complexity of ontology engineering workflows. This paper presents and investigates the applicability of an ontology learning pipeline that combin...

Abdelhadi Belfadel, Maxence Gagnant, Joseph Kattan et al. · 0 citations
#large language models Book Oct 2026

Structured Knowledge Graph for Scholarly Exploration: IR and QA System for ETDs and their Elements

Electronic Theses and Dissertations (ETDs) contain rich and detailed scholarly knowledge, but accessing that remains difficult. Conventional search systems largely operate at the document level and provide only coarse access to long-form academic writing. Though large language models (LLMs) can generate fluent response...

Satvik Chekuri, Edward A. Fox · 0 citations
Conference Aug 2026

Job-Person Knowledge Extraction Method Based on Large Language Models

In the data extraction process for job-person recommendation systems, the data structures present in various forms including structured, semi-structured, and unstructured formats, which leads to significant difficulty and low efficiency in manual knowledge graph construction. Although deep learning techniques have adva...

Yuan-Han Xie, Hao-Chen Gong, Dan-Ni Hu et al. · 0 citations
Preprint Aug 2026

Compositional Chain-of-Relations for Faithful Knowledge Graph Question Answering with Large Language Models

A relation-centric exploration paradigm is introduced, which uses relations rather than entities as search units and thus avoids unreliable entity pruning and proposes Compositional Chain-of-Relations (CCoR), a simple and effective framework that grounds both phases in the KG with two relation chains.

Chenhui Liu, Jianpeng Zhou, Jia-Hai Wang · 0 citations

Related blog posts

Hugging Face Blog Oct 20, 2026

MPS in PyTorch 2.15

We’re on a journey to advance and democratize artificial intelligence through open source and open science.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.