FlexER: Flexible Entity Resolution for Multiple Intents
Bar Genossar, Roee Shraga, Avigdor Gal
Abstract
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 realworld 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers4
- ELEET: Efficient Learned Query Execution over Text and TablesMatthias Urban, Carsten BinnigVLDB 2024 · 15 citations
- MultiEM: Efficient and Effective Unsupervised Multi-Table Entity MatchingXiaocan Zeng, Pengfei Wang, Yuren Mao, Lu Chen et al.ICDE 2024 · 5 citations
- OmniMatch: Joinability Discovery in Data ProductsChristos Koutras, Jiani Zhang, Xiao Qin, Chuan Lei et al.VLDB 2025 · 3 citations
- Learning from Natural Language Explanations for Generalizable Entity MatchingSomin Wadhwa, Adit Krishnan, Runhui Wang, Byron C. Wallace et al.EMNLP 2024 · 3 citations
Builds on11
- Deep Entity Matching with Pre-Trained Language ModelsYuliang Li, Jinfeng Li, Yoshihiko Suhara, AnHai Doan et al.VLDB 2021 · 484 citations
- Creating Embeddings of Heterogeneous Relational Datasets for Data Integration TasksRiccardo Cappuzzo, Paolo Papotti, Saravanan ThirumuruganathanSIGMOD 2020 · 139 citations
- Deep Learning for Blocking in Entity Matching: A Design Space ExplorationSaravanan Thirumuruganathan, Han Li, Nan Tang, Mourad Ouzzani et al.VLDB 2021 · 109 citations
- Dual-Objective Fine-Tuning of BERT for Entity MatchingRalph Peeters, Christian BizerVLDB 2021 · 71 citations
- Rotom: A Meta-Learned Data Augmentation Framework for Entity Matching, Data Cleaning, Text Classification, and BeyondZhengjie Miao, Yuliang Li, Xiaolan WangSIGMOD 2021 · 63 citations
Related papers
- GraphER: Token-Centric Entity Resolution with Graph Convolutional Neural NetworksBing Li, Wei Wang, Yifang Sun, Linhan Zhang et al.AAAI 2020 · 48 citations
- GNEM: A Generic One-to-Set Neural Entity Matching FrameworkRunjin Chen, Yanyan Shen, Dongxiang ZhangWWW 2021 · 24 citations
- Splitting Tuples of Mismatched EntitiesWenfei Fan, Ziyan Han, Weilong Ren, Ding Wang et al.SIGMOD 2024 · 5 citations
- A Critical Re-evaluation of Record Linkage Benchmarks for Learning-Based Matching AlgorithmsGeorge Papadakis, Nishadi Kirielle, Peter Christen, Themis PalpanasICDE 2024 · 8 citations
- Entity Resolution with Hierarchical Graph Attention NetworksDezhong Yao, Yuhong Gu, Gao Cong, Hai Jin et al.SIGMOD 2022 · 56 citations
