Metraipolis › archive › dc_9d8fde2dd75d

Automated Tree Knowledge Graph Construction using Ontology Expansion and Retrieval from Vietnamese History Textbooks — arXiv:2609.00763

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.00763
License (as archived)
CC0-1.0
Archived
2026-10-17T06:32:05.788Z
SHA-256 of the archived text
fc7d03c91544bf5ba5f89e25b809f2089ff58e026d4c4d64ab333a28e00635a9
Stable URL of this page
https://metraipolis.com/documento/dc_9d8fde2dd75d

How to cite

Automated Tree Knowledge Graph Construction using Ontology Expansion and Retrieval from Vietnamese History Textbooks — arXiv:2609.00763 — arXiv (en), https://arxiv.org/abs/2609.00763 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9d8fde2dd75d (Metraipolis archive dc_9d8fde2dd75d, sha256 fc7d03c91544bf5ba5f89e25b809f2089ff58e026d4c4d64ab333a28e00635a9)
BibTeX
@misc{dc9d8fde2dd75d,
  title = {Automated Tree Knowledge Graph Construction using Ontology Expansion and Retrieval from Vietnamese History Textbooks — arXiv:2609.00763},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.00763},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9d8fde2dd75d; sha256 fc7d03c91544bf5ba5f89e25b809f2089ff58e026d4c4d64ab333a28e00635a9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.00763. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-02 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.00763 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T06:15:12.639Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).