Generating Concise Entity Matching Rules
© 2017 ACM. Entity matching (EM) is a critical part of data integration and cleaning. In many applications, the users need to understand why two entities are considered a match, which reveals the need for interpretable and concise EM rules. We model EM rules in the form of General Boolean Formulas (...
Main Authors: | Singh, Rohit, Meduri, Vamsi, Elmagarmid, Ahmed, Madden, Samuel, Papotti, Paolo, Quiané-Ruiz, Jorge-Arnulfo, Solar-Lezama, Armando, Tang, Nan |
---|---|
Format: | Article |
Language: | English |
Published: |
ACM
2021
|
Online Access: | https://hdl.handle.net/1721.1/137855 |
Similar Items
-
Generating Concise Entity Matching Rules
by: Singh, Rohit, et al.
Published: (2022) -
Automatically learning optimal formula simplifiers and database entity matching rules
by: Singh, Rohit, Ph. D. Massachusetts Institute of Technology
Published: (2018) -
BigDansing
by: Khayyat, Zuhair, et al.
Published: (2017) -
Concise rules of APA style
by: American Psychological Association
Published: (c201) -
Sloth: Being Lazy is a Virtue (When Issuing Database Queries)
by: Cheung, Alvin, et al.
Published: (2014)