pith. sign in

arxiv: 1508.06013 · v1 · pith:MGCXDJHFnew · submitted 2015-08-25 · 💻 cs.DB · cs.AI· cs.LG

ERBlox: Combining Matching Dependencies with Machine Learning for Entity Resolution

classification 💻 cs.DB cs.AIcs.LG
keywords datadeclarativedependenciesduplicateentitylearningmachinematching
0
0 comments X
read the original abstract

Entity resolution (ER), an important and common data cleaning problem, is about detecting data duplicate representations for the same external entities, and merging them into single representations. Relatively recently, declarative rules called matching dependencies (MDs) have been proposed for specifying similarity conditions under which attribute values in database records are merged. In this work we show the process and the benefits of integrating three components of ER: (a) Classifiers for duplicate/non-duplicate record pairs built using machine learning (ML) techniques, (b) MDs for supporting both the blocking phase of ML and the merge itself; and (c) The use of the declarative language LogiQL -an extended form of Datalog supported by the LogicBlox platform- for data processing, and the specification and enforcement of MDs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.