2026· International Conference on Data Technologies and Applications· pp. 925-932· 0 citations· 7 references
Computer Science
TL;DR
This work presents a Named Entity Management System (NEMS) that integrates entity lifecycle management with scalable matching in a unified workflow for knowledge graph creation, and embeds matching and validation during ingestion, combining attribute-level similarity with graph-structured and ontology-aware signals to guide merge decisions.
Abstract
: Entity Matching (EM) is a core challenge in data integration, requiring the identification of records that refer to the same real-world entity across heterogeneous sources. Practical experience shows that overall performance depends on end-to-end system design rather than isolated algorithms: candidate generation, threshold calibration, provenance tracking, consolidation policies, and iterative error analysis often determine effectiveness. Ontologies, knowledge graphs, and persistent identifiers provide semantic context and stable references, but introduce additional complexity in handling uncertainty and evolving representations. We present a Named Entity Management System (NEMS) that integrates entity lifecycle management with scalable matching in a unified workflow for knowledge graph creation. Instead of treating reconciliation as post-processing, NEMS embeds matching and validation during ingestion, combining attribute-level similarity with graph-structured and ontology-aware signals to guide merge decisions. By integrating canonical identifiers, provenance tracking, and configurable decision thresholds, NEMS enables conservative merging, incremental updates, and explainable outcomes. The architecture accommodates diverse matching paradigms while leveraging structural context, providing a robust foundation for scalable and consistent entity integration.
The results support the feasibility of ontology-driven generation for static-classification systems, whereas arithmetic risk computation and temporal event processing remain better suited to complementary procedural technologies.
Borivoj Bogdanović, S. Nikolić· Computers· 0 citations
The results show that structured RDF pipelines currently provide the most stable integration behavior, whereas JSON and text pipelines remain more sensitive to errors in mapping, extraction, and linking.
This paper describes the ingestion and ontology-tagging layer that turns a validated extraction stream into a knowledge graph of 537,157 entities and 2,198,567 relationships drawn from 98,795 government documents, and describes a record-identity ladder that decides sameness from identifier columns, name columns, displa...
Vaibhav Dangaich, Kevin Lewis, Kundeshwar Pundalik· 0 citations
This work describes the modelling of a relational RDM system with an ontology, and the subsequent construction of a KG based on it, and shows how to easily and reliably build an efficient KG from such domain-specific RDM systems, but also how doing so enables more advanced use cases.
S. Vázquez, V. Dudarev, A. Ludwig et al.· 0 citations
This work proposes 5W1H+Which, a semantic indexing design that separates content extraction from ontology binding, and distinguishes business valid time, system knowledge time, and operational traces, and uses dependency records to support binding revalidation and the maintenance of derived conclusions.
Ya-Xiao Liu, Peng Liu, Yi-Wen Liu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.