Efficient and Tractable Conflict Detection in Knowledge Graphs via Path Analysis

Knowledge graphs (KGs), which utilize graph structures to represent real-world facts, are pivotal in information retrieval and artificial intelligence. However, heuristic knowledge graph construction methods will produce errors. Some conflicts, such as expression ambiguities, are challenging to detect at triple granularity and require semantic analysis together with other triples. In this paper, we propose an approach for conflict detection at path granularity in large-scale knowledge graphs. It is based on rules on a specific pattern. Different from previous rules, our rules are defined with a ring pattern to extend error detection from triple granularity to path granularity. We prove that indicating whether a triple brings such conflicts only requires dealing with any one of its related ring structures, which can significantly reduce the complexity. We propose <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">${\mathsf {{RingE}}}$</tex-math></inline-formula>, a novel Ring Embedding method, to detect ring-pattern conflicts, and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">${\mathsf {{DeCon}}}$</tex-math></inline-formula>, a CONflict DEtection framework suitable for both static and incremental scenes. This framework divides the ring-pattern conflict detection task in KGs into ring discovery and conflict detection. We also design a pruning strategy for ring discovery that reduces the time complexity from the exponential level to the polynomial level. Using real-world graphs, we experimentally verify that our algorithms are effective and feasible for large graphs. Our case study also verifies that <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">${\mathsf {{DeCon}}}$</tex-math></inline-formula> can detect real conflicts.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Big Data
Published
2025-06-02
DOI
https://doi.org/10.1109/tbdata.2025.3575948
Citations
2
Primary Topic
Text and Document Classification Technologies
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and Tractable Conflict Detection in Knowledge Graphs via Path Analysis

Y. Wang, Ling Zheng, Xiang‐Yang Li, Qi Song
2 citations
IEEE Transactions on Big Data
Text and Document Classification Technologies
4.96
article

Efficient and Tractable Conflict Detection in Knowledge Graphs via Path Analysis

Y. Wang, Ling Zheng, Xiang‐Yang Li, Qi Song
article en
2 citations

Abstract

Knowledge graphs (KGs), which utilize graph structures to represent real-world facts, are pivotal in information retrieval and artificial intelligence. However, heuristic knowledge graph construction methods will produce errors. Some conflicts, such as expression ambiguities, are challenging to detect at triple granularity and require semantic analysis together with other triples. In this paper, we propose an approach for conflict detection at path granularity in large-scale knowledge graphs. It is based on rules on a specific pattern. Different from previous rules, our rules are defined with a ring pattern to extend error detection from triple granularity to path granularity. We prove that indicating whether a triple brings such conflicts only requires dealing with any one of its related ring structures, which can significantly reduce the complexity. We propose <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">${\mathsf {{RingE}}}$</tex-math></inline-formula>, a novel Ring Embedding method, to detect ring-pattern conflicts, and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">${\mathsf {{DeCon}}}$</tex-math></inline-formula>, a CONflict DEtection framework suitable for both static and incremental scenes. This framework divides the ring-pattern conflict detection task in KGs into ring discovery and conflict detection. We also design a pruning strategy for ring discovery that reduces the time complexity from the exponential level to the polynomial level. Using real-world graphs, we experimentally verify that our algorithms are effective and feasible for large graphs. Our case study also verifies that <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">${\mathsf {{DeCon}}}$</tex-math></inline-formula> can detect real conflicts.

IEEE Transactions on Big DataVol. 11(6)
University of Science and Technology of China (CN)
Openalex Percentile: Top 5%
Text and Document Classification Technologies
4.96
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.