Combining Global and Local Merges in Logic-based Entity Resolution

05/26/2023
by   Meghyn Bienvenu, et al.
0

In the recently proposed Lace framework for collective entity resolution, logical rules and constraints are used to identify pairs of entity references (e.g. author or paper ids) that denote the same entity. This identification is global: all occurrences of those entity references (possibly across multiple database tuples) are deemed equal and can be merged. By contrast, a local form of merge is often more natural when identifying pairs of data values, e.g. some occurrences of 'J. Smith' may be equated with 'Joe Smith', while others should merge with 'Jane Smith'. This motivates us to extend Lace with local merges of values and explore the computational properties of the resulting formalism.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2011

Query-time Entity Resolution

Entity resolution is the problem of reconciling database references corr...
research
07/04/2016

Generic Statistical Relational Entity Resolution in Knowledge Graphs

Entity resolution, the problem of identifying the underlying entity of r...
research
06/26/2014

Communicating and resolving entity references

Statements about entities occur everywhere, from newspapers and web page...
research
09/29/2017

Entity Consolidation: The Golden Record Problem

Four key processes in data integration are: data preparation (i.e., extr...
research
08/18/2021

Publisher References in Bibliographic Entity Descriptions

This paper describes a method for improved access to publisher reference...
research
03/12/2023

Another Generic Setting for Entity Resolution: Basic Theory

Benjelloun et al. <cit.> considered the Entity Resolution (ER) problem a...
research
06/20/2018

Developing a Temporal Bibliographic Data Set for Entity Resolution

Entity resolution is the process of identifying groups of records within...

Please sign up or login with your details

Forgot password? Click here to reset