Jul 2026· Dandao Xuebao/Journal of Ballistics· Vol 38, pp. 285-305· 0 citations
TL;DR
The proposed approach effectively bridges the gap between unstructured text and structured knowledge representation, enabling reliable, scalable, and high-quality knowledge graph construction.
Abstract
The rapid growth of unstructured textual data necessitates automated approaches for transforming such information into structured, machine-readable knowledge. Knowledge Graphs (KGs) provide an effective framework for representing entities and their relationships; however, existing methods often suffer from fragmented pipelines, limited semantic consistency, and challenges in handling domain-specific variations. This paper presents an intelligent and scalable approach for knowledge graph construction from semantically enriched keyword-based inputs derived from a context-aware extraction process. The proposed method employs a unified pipeline comprising entity identification and ontology-based linking, context-aware relation extraction, and structured triple generation in the form of subject-predicate-object (SPO) representations. The generated triples are futher transformed into RDF format and organized into a coherent knowledge graph, followed by refinement steps to ensure semantic consistency and structural integrity. The approach is evaluated on representative datasets, including PubMed abstracts, and demonstrates improved performance in triplet extraction, entity and relation accuracy, and graph-level quality metrics such as density, clustering coefficient, and modularity. Comparative analysis with baseline methods highlights the effectiveness of the proposed approach in generating coherent and semantically enriched knowledge graphs. Additionally, the system exhibits strong scalability and computational efficiency, making it suitable for large-scale and real-world applications acreoss diverse domains. Overall, the proposed approach effectively bridges the gap between unstructured text and structured knowledge representation, enabling reliable, scalable, and high-quality knowledge graph construction.
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.
A production extraction layer that converts a live document stream into a validated knowledge graph aligned to a formal ontology, and improved search recall from roughly 70 to 95 percent with no false merges, and corrected seven classes of silent quality defect.
Vaibhav Dangaich, Kevin Lewis, Kundeshwar Pundalik· arXiv.org· 0 citations
The increasing presence of heterogeneous data sources in modern information systems has intensified the need for intelligent data integration processes capable of handling semantic complexity, structural diversity, and dynamic changes. Traditional data integration methods, primarily based on relational schemas and syntactic mappings, struggle to address semantic heterogeneity in large-scale distributed environments. Knowledge graphs have emerged as a powerful paradigm, enabling semantically rich, flexible, and scalable integration by representing data as interconnected entities with metadata, ontologies, and inference capabilities. Using technologies such as RDF and OWL, knowledge graphs support interoperability, contextual reasoning, and unified data views across systems. This paper examines knowledge graph-based intelligent data integration systems, focusing on their architecture, methodology, and practical applications. It highlights their advantages in schema alignment, entity resolution, and semantic enrichment over traditional ETL approaches. The integration of machine learning techniques further enhances automation in data mapping, anomaly detection, and knowledge discovery. A systematic framework is proposed, covering ontology design, data ingestion, graph construction, and query optimization. A conceptual case study demonstrates improved integration accuracy, scalability, and query performance. Evaluation results indicate enhanced data quality, interoperability, and reasoning capabilities, along with reduced integration latency. Overall, knowledge graphs serve as a key enabler for next-generation intelligent data integration, supporting complex relationships and data-driven decision-making. Future work includes improving scalability, real-time processing, and integration with deep learning models.
Muhammad Al-Azar· International Journal of App...· 0 citations
Knowledge Graph Construction (KGC) is essential for transforming unstructured text into structured knowledge representations. Despite advances in Large Language Models, existing methods treat KGC as a single-pass generation task, conflating extraction, normalization, and validation within a single forward pass. This leads to hallucinated facts, polysemous conflation, and fragmented triples, particularly in open-domain settings where predefined schemas are unavailable. In this work, we propose AgentsKG, a hierarchical multi-agent framework that decouples semantic perception from structural integration. In the Semantic Perception Layer, a multi-role Verification Committee filters hallucinated and invalid assertions through majority voting, while a Contextual Profiler resolves polysemous ambiguities by enriching mentions with context-dependent semantic descriptors. In the Structural Integration Layer, a Knowledge Linker merges redundant entities and relations based on semantic profiles, and an Ontological Logic Auditor enforces logical consistency across the graph. Extensive experiments demonstrate that AgentsKG outperforms state-of-the-art training-free baselines in both extraction accuracy and structural quality, offering a robust approach to open-domain knowledge graph construction without additional training. Source code is available at https://doi.org/10.5281/zenodo.20484211
Shilong Liu, Yongqiang Liu, Jiye Liu et al.· Proceedings of the 32nd ACM...· 0 citations
The proposed knowledge graph construction method for the workpiece machining distortion domain is proposed, together with an intelligent decision-making framework driven by the collaboration of knowledge graphs and large language models, providing a feasible pathway for the structured organization, intelligent retrieval, and decision support of workpiece machining distortion knowledge.
Deguo Yao, Zhaoze Sun, Jie Gao et al.· Applied System Innovation· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.