Machop: an end-to-end generalized entity matching framework

Jin Wang, Yuliang Li, Wataru Hirota, Eser Kandogan
{"title":"Machop: an end-to-end generalized entity matching framework","authors":"Jin Wang, Yuliang Li, Wataru Hirota, Eser Kandogan","doi":"10.1145/3533702.3534910","DOIUrl":null,"url":null,"abstract":"Real-world applications frequently seek to solve a general form of the Entity Matching (EM) problem to find associated entities. Such scenarios include matching jobs to candidates in job targeting, matching students with courses in online education, matching products with user reviews on e-commercial websites, and beyond. These tasks impose new requirements such as matching data entries with diverse formats or having a flexible and semantics-rich matching definition, which are beyond the current EM task formulation or approaches. In this paper, we introduce the problem of Generalized Entity Matching (GEM) that satisfies these practical requirements and presents an end-to-end pipeline Machop as the solution. Machop allows end users to define new matching tasks from scratch and apply them to new domains in a step-by-step manner. Machop casts the GEM problem as sequence pair classification so as to utilize the language understanding capability of Transformers-based language models (LMs) such as BERT. Moreover, it features a novel external knowledge injection approach with structure-aware pooling methods that allow domain experts to guide the LM to focus on the key matching information thus further contributing to the overall performance. Our experiments and case studies on real-world datasets from a popular recruiting platform show a significant 17.1% gain in F1 score against state-of-the-art methods along with meaningful matching results that are human understandable.","PeriodicalId":204060,"journal":{"name":"Proceedings of the Fifth International Workshop on Exploiting Artificial Intelligence Techniques for Data Management","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth International Workshop on Exploiting Artificial Intelligence Techniques for Data Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3533702.3534910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Real-world applications frequently seek to solve a general form of the Entity Matching (EM) problem to find associated entities. Such scenarios include matching jobs to candidates in job targeting, matching students with courses in online education, matching products with user reviews on e-commercial websites, and beyond. These tasks impose new requirements such as matching data entries with diverse formats or having a flexible and semantics-rich matching definition, which are beyond the current EM task formulation or approaches. In this paper, we introduce the problem of Generalized Entity Matching (GEM) that satisfies these practical requirements and presents an end-to-end pipeline Machop as the solution. Machop allows end users to define new matching tasks from scratch and apply them to new domains in a step-by-step manner. Machop casts the GEM problem as sequence pair classification so as to utilize the language understanding capability of Transformers-based language models (LMs) such as BERT. Moreover, it features a novel external knowledge injection approach with structure-aware pooling methods that allow domain experts to guide the LM to focus on the key matching information thus further contributing to the overall performance. Our experiments and case studies on real-world datasets from a popular recruiting platform show a significant 17.1% gain in F1 score against state-of-the-art methods along with meaningful matching results that are human understandable.
Machop:一个端到端的广义实体匹配框架
实际应用程序经常寻求解决实体匹配(EM)问题的一般形式,以查找相关实体。这样的场景包括在求职中匹配工作与候选人,在在线教育中匹配学生与课程,在电子商务网站上匹配产品与用户评论等等。这些任务提出了新的要求,例如匹配具有不同格式的数据条目,或者具有灵活且语义丰富的匹配定义,这些都超出了当前EM任务的表述或方法。在本文中,我们介绍了满足这些实际需求的广义实体匹配(GEM)问题,并提出了端到端管道Machop作为解决方案。Machop允许最终用户从头定义新的匹配任务,并逐步将其应用于新域。Machop将GEM问题转换为序列对分类,以便利用基于transformer的语言模型(例如BERT)的语言理解能力。此外,它还采用了一种新颖的外部知识注入方法,采用结构感知池方法,允许领域专家指导LM关注关键匹配信息,从而进一步提高整体性能。我们对来自一个受欢迎的招聘平台的真实数据集进行的实验和案例研究表明,与最先进的方法相比,F1得分显著提高了17.1%,并且有意义的匹配结果是人类可以理解的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书