Enforcing Relational Matching Dependencies with Datalog for Entity Resolution
원문 초록
Entity resolution (ER) is about identifying and merging records in a database that represent the same real-world entity. Matching dependencies (MDs) have been introduced and investigated as declarative rules that specify ER policies. An ER process induced by MDs over a dirty instance leads to multiple clean instances, in general. General "answer sets programs" have been proposed to specify the MD-based cleaning task and its results. In this work, we extend MDs to "relational MDs", which capture more application semantics, and identify classes of relational MDs for which the general ASP can be automatically rewritten into a stratified Datalog program, with the single clean instance as its standard model.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Bonafide at LegalLens 2024 Shared Task: Using Lightweight DeBERTa Based Encoder For Legal Violation Detection and Resolution
T-KAER: Transparency-enhanced Knowledge-Augmented Entity Resolution Framework
Fine-tuning Large Language Models for Entity Matching
Match, Compare, or Select? An Investigation of Large Language Models for Entity Matching
Towards Universal Dense Blocking for Entity Resolution
How to Evaluate Entity Resolution Systems: An Entity-Centric Framework with Application to Inventor Name Disambiguation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.