FlexER: Flexible Entity Resolution for Multiple Intents

Author:

Genossar Bar1ORCID,Shraga Roee2ORCID,Gal Avigdor1ORCID

Affiliation:

1. Technion -- Israel Institute of Technology, Haifa, Israel

2. Northeastern University, Boston, MA, USA

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 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 MIER. 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.

Funder

Benjamin and Florence Free Chair

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Reference65 articles.

1. Clean Answers over Dirty Databases: A Probabilistic Approach

2. Nitin Bhatia et al. 2010. Survey of nearest neighbor techniques. arXiv preprint arXiv:1007.0085 (2010). Nitin Bhatia et al. 2010. Survey of nearest neighbor techniques. arXiv preprint arXiv:1007.0085 (2010).

3. Adaptive duplicate detection using learnable string similarity measures

4. Countering Bias in Personalized Rankings : From Data Engineering to Algorithm Development

5. Ursin Brunner and Kurt Stockinger . 2020 . Entity matching with transformer architectures-a step forward in data integration . In International Conference on Extending Database Technology. Ursin Brunner and Kurt Stockinger. 2020. Entity matching with transformer architectures-a step forward in data integration. In International Conference on Extending Database Technology.

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. MultiEM: Efficient and Effective Unsupervised Multi-Table Entity Matching;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. SC-Block: Supervised Contrastive Blocking Within Entity Resolution Pipelines;Lecture Notes in Computer Science;2024

3. Everything there is to Know about Stochastically Known Logs;2023 5th International Conference on Process Mining (ICPM);2023-10-23

4. Data Integration Landscapes: The Case for Non-optimal Solutions in Network Diffusion Models;Computational Science – ICCS 2023;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3