mlsanityData to 7 Oct 2026

FlexER: Flexible Entity Resolution for Multiple Intents

arXiv 2209.07569 ↗First posted 23 Aug 2022cs.CL cs.DBcited by 6

Not on the map. Why?

Abstract (arXiv)

Entity resolution, a longstanding problem of data cleaning and integration, aims at identifying data records that represent the same real-world entity. Existing approaches treat entity resolution as a universal task, assuming the existence of a single interpretation of a real-world entity and focusing only on finding matched records, separating corresponding from non-corresponding ones, with respect to this single interpretation. However, in real-world scenarios, where entity resolution is part of a more general data project, downstream applications may have varying interpretations of real-world entities relating, for example, to various user needs. In what follows, we introduce the problem of multiple intents entity resolution (MIER), an extension to the universal (single intent) entity resolution task. As a solution, we propose FlexER, utilizing contemporary solutions to universal entity resolution tasks to solve multiple intents entity resolution. FlexER addresses the problem as a multi-label classification problem. It combines intent-based representations of tuple pairs using a multiplex graph representation that serves as an input to a graph neural network (GNN). FlexER learns intent representations and improves the outcome to multiple resolution problems. A large-scale empirical evaluation introduces a new benchmark and, using also two well-known benchmarks, shows that FlexER effectively solves the MIER problem and outperforms the state-of-the-art for a universal entity resolution.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 17 of its 65 references that are in the map. First posted on arXiv 23 Aug 2022.

Builds on

17 of 65 references.

References · 17

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2017Inductive Representation Learning on Large Graphscited by 6,284
  6. 2017Billion-scale similarity search with GPUscited by 2,477
  7. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  8. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  9. 2020Deep Entity Matching with Pre-Trained Language Modelscited by 143
  10. 2019Learning a Deep ConvNet for Multi-label Classification with Partial Labelscited by 124
  11. 2017DeepER -- Deep Entity Resolutioncited by 54
  12. 2019Low-resource Deep Entity Resolution with Transfer and Active Learningcited by 37
5 more
  1. 2020STEAM: Self-Supervised Taxonomy Expansion with Mini-Pathscited by 31
  2. 2020TXtract: Taxonomy-Aware Knowledge Extraction for Thousands of Product Categoriescited by 29
  3. 2020Modeling Voting for System Combination in Machine Translationcited by 18
  4. 2020A Comprehensive Benchmark Framework for Active Learning Methods in Entity Matchingcited by 17
  5. 2021Machamp: A Generalized Entity Matching Benchmarkcited by 16

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 3.

6 papers.