Combining Global and Local Merges in Logic-based Entity Resolution

• URL: http://arxiv.org/abs/2305.16926v2
• Date: Mon, 29 May 2023 20:30:23 GMT
• Title: Combining Global and Local Merges in Logic-based Entity Resolution
• Authors: Meghyn Bienvenu, Gianluca Cima, V\'ictor Guti\'errez-Basulto, Yazm\'in Ib\'a\~nez-Garc\'ia
• Abstract summary: Lace is a framework for collective entity resolution. logical rules and constraints are used to identify pairs of entity references that denote the same entity. All occurrences of those entity references are deemed equal and can be merged. This motivates us to extend Lace with local merges of values and explore the computational properties of the resulting formalism.
• Score: 11.189054189860158
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• SiReRAG: Indexing Similar and Related Information for Multihop Reasoning [96.60045548116584]
  SiReRAG is a novel RAG indexing approach that explicitly considers both similar and related information.<n>SiReRAG consistently outperforms state-of-the-art indexing methods on three multihop datasets.
  arXiv  Detail & Related papers  (2024-12-09T04:56:43Z)
• Entity Disambiguation via Fusion Entity Decoding [68.77265315142296]
  We propose an encoder-decoder model to disambiguate entities with more detailed entity descriptions. We observe +1.5% improvements in end-to-end entity linking in the GERBIL benchmark compared with EntQA.
  arXiv  Detail & Related papers  (2024-04-02T04:27:54Z)
• A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases [13.700646439200423]
  We propose a new framework for entity resolution and query answering in knowledge bases. We define the semantics of the KB in terms of special instances that involve equivalence classes of entities and sets of values. We then design a chase procedure that is tailored to this new framework and has the feature that it never fails.
  arXiv  Detail & Related papers  (2023-03-13T21:10:57Z)
• xEM: Explainable Entity Matching in Customer 360 [0.0]
  We present our Explainable Entity Matching (xEM) system. In this demo, we discuss the different AI/ML considerations that went into its implementation.
  arXiv  Detail & Related papers  (2022-12-01T08:01:01Z)
• Relational Proxies: Emergent Relationships as Fine-Grained Discriminators [52.17542855760418]
  We propose a novel approach that leverages information between the global and local part of an object for encoding its label. We design Proxies based on our theoretical findings and evaluate it on seven challenging fine-grained benchmark datasets. We also experimentally validate our theory and obtain consistent results across multiple benchmarks.
  arXiv  Detail & Related papers  (2022-10-05T11:08:04Z)
• Exploiting Global Semantic Similarities in Knowledge Graphs by Relational Prototype Entities [55.952077365016066]
  An empirical observation is that the head and tail entities connected by the same relation often share similar semantic attributes. We propose a novel approach, which introduces a set of virtual nodes called textittextbfrelational prototype entities. By enforcing the entities' embeddings close to their associated prototypes' embeddings, our approach can effectively encourage the global semantic similarities of entities.
  arXiv  Detail & Related papers  (2022-06-16T09:25:33Z)
• Parallel Instance Query Network for Named Entity Recognition [73.30174490672647]
  Named entity recognition (NER) is a fundamental task in natural language processing. Recent works treat named entity recognition as a reading comprehension task, constructing type-specific queries manually to extract entities. We propose Parallel Instance Query Network (PIQN), which sets up global and learnable instance queries to extract entities in a parallel manner.
  arXiv  Detail & Related papers  (2022-03-20T13:01:25Z)
• UniRE: A Unified Label Space for Entity Relation Extraction [67.53850477281058]
  Joint entity relation extraction models setup two separated label spaces for the two sub-tasks. We argue that this setting may hinder the information interaction between entities and relations. In this work, we propose to eliminate the different treatment on the two sub-tasks' label spaces.
  arXiv  Detail & Related papers  (2021-07-09T08:09:37Z)
• Exploiting Transitivity Constraints for Entity Matching in Knowledge Graphs [1.7080853582489066]
  We show that an ad-hoc enforcement of transitivity on identified set of entity pairs may decrease precision dramatically. We 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.
  arXiv  Detail & Related papers  (2021-04-22T10:57:01Z)
• Autoregressive Entity Retrieval [55.38027440347138]
  Entities are at the center of how we represent and aggregate knowledge. The ability to retrieve such entities given a query is fundamental for knowledge-intensive tasks such as entity linking and open-domain question answering. We propose GENRE, the first system that retrieves entities by generating their unique names, left to right, token-by-token in an autoregressive fashion.
  arXiv  Detail & Related papers  (2020-10-02T10:13:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.