Exploiting Transitivity Constraints for Entity Matching in Knowledge Graphs
원문 초록
The goal of entity matching in knowledge graphs is to identify entities that refer to the same real-world objects using some similarity metric. The result of entity matching can be seen as a set of entity pairs interpreted as the same-as relation. However, the identified set of pairs may fail to satisfy some structural properties, in particular transitivity, that are expected from the same-as relation. In this work, we show that an ad-hoc enforcement of transitivity, i.e. taking the transitive closure, on the identified set of entity pairs may decrease precision dramatically. We therefore propose a methodology that starts with a given similarity measure, generates a set of entity pairs that are identified as referring to the same real-world objects, and applies the cluster editing algorithm to enforce transitivity without adding many spurious links, leading to overall improved performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion
Knowledge-augmented Pre-trained Language Models for Biomedical Relation Extraction
SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs
Relation Extraction Across Entire Books to Reconstruct Community Networks: The AffilKG Datasets
GraphOracle: A Foundation Model for Knowledge Graph Reasoning
Enhancing Knowledge Graph Completion with Entity Neighborhood and Relation Context
토론
이 논문과 연결된 포럼 글이 아직 없습니다.