Comparing Heuristic Rules and Masked Language Models for Entity Alignment in the Literature Domain

IF 2.1 3区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS ACM Journal on Computing and Cultural Heritage Pub Date : 2023-07-15 DOI:10.1145/3606699
Dominique Piché, L. Font, A. Zouaq, M. Gagnon
{"title":"Comparing Heuristic Rules and Masked Language Models for Entity Alignment in the Literature Domain","authors":"Dominique Piché, L. Font, A. Zouaq, M. Gagnon","doi":"10.1145/3606699","DOIUrl":null,"url":null,"abstract":"The cultural world offers a staggering amount of rich and varied metadata on cultural heritage, accumulated by governmental, academic and commercial players. However, the variety of involved institutions means that the data is stored in as many complex and often incompatible models and standards, which limits its availability and explorability by the greater public. The adoption of Linked Open Data technologies allows a strong interlinking of these various databases as well as external connections with existing knowledge bases. However, as they often contain references to the same entities, the delicate issue of entity alignment becomes the central challenge, especially in the absence or scarcity of unique global identifiers. To tackle this issue, we explored two approaches, one based on a set of heuristic rules, and one based on masked language models, or MLMs. We compare these two approaches, as well as different variations of MLMs, including some models trained on a different language, and various levels of data cleaning and labeling. Our results show that heuristics are a solid approach, but also that MLM-based entity alignment obtains better performance coupled with the fact that it is robust to the data format, and does not require any form of data preprocessing, which was not the case of the heuristic approach in our experiments.","PeriodicalId":54310,"journal":{"name":"ACM Journal on Computing and Cultural Heritage","volume":"114 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Journal on Computing and Cultural Heritage","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3606699","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The cultural world offers a staggering amount of rich and varied metadata on cultural heritage, accumulated by governmental, academic and commercial players. However, the variety of involved institutions means that the data is stored in as many complex and often incompatible models and standards, which limits its availability and explorability by the greater public. The adoption of Linked Open Data technologies allows a strong interlinking of these various databases as well as external connections with existing knowledge bases. However, as they often contain references to the same entities, the delicate issue of entity alignment becomes the central challenge, especially in the absence or scarcity of unique global identifiers. To tackle this issue, we explored two approaches, one based on a set of heuristic rules, and one based on masked language models, or MLMs. We compare these two approaches, as well as different variations of MLMs, including some models trained on a different language, and various levels of data cleaning and labeling. Our results show that heuristics are a solid approach, but also that MLM-based entity alignment obtains better performance coupled with the fact that it is robust to the data format, and does not require any form of data preprocessing, which was not the case of the heuristic approach in our experiments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
文献领域实体对齐的启发式规则和掩码语言模型的比较
文化界提供了数量惊人的丰富多样的文化遗产元数据,这些数据是由政府、学术和商业参与者积累起来的。然而,涉及的机构种类繁多,这意味着数据存储在许多复杂且往往不兼容的模型和标准中,这限制了更多公众对其可用性和可探索性。链接开放数据技术的采用使得这些不同的数据库之间有了强大的相互链接,也使得与现有知识库的外部连接成为可能。然而,由于它们经常包含对相同实体的引用,因此实体对齐的微妙问题成为了核心挑战,特别是在缺乏或缺乏唯一全局标识符的情况下。为了解决这个问题,我们探索了两种方法,一种基于一组启发式规则,另一种基于掩码语言模型(mlm)。我们比较了这两种方法,以及传销的不同变体,包括在不同语言上训练的一些模型,以及不同级别的数据清理和标记。我们的结果表明,启发式方法是一种可靠的方法,而且基于mlm的实体对齐获得了更好的性能,并且它对数据格式具有鲁棒性,并且不需要任何形式的数据预处理,这不是我们实验中的启发式方法的情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
ACM Journal on Computing and Cultural Heritage
ACM Journal on Computing and Cultural Heritage Arts and Humanities-Conservation
CiteScore
4.60
自引率
8.30%
发文量
90
期刊介绍: ACM Journal on Computing and Cultural Heritage (JOCCH) publishes papers of significant and lasting value in all areas relating to the use of information and communication technologies (ICT) in support of Cultural Heritage. The journal encourages the submission of manuscripts that demonstrate innovative use of technology for the discovery, analysis, interpretation and presentation of cultural material, as well as manuscripts that illustrate applications in the Cultural Heritage sector that challenge the computational technologies and suggest new research opportunities in computer science.
期刊最新文献
Heritage Iconographic Content Structuring: from Automatic Linking to Visual Validation Digitising the Deep Past: Machine Learning for Rock Art Motif Classification in an Educational Citizen Science Application Interpretable Clusters for Representing Citizens’ Sense of Belonging through Interaction with Cultural Heritage Classification of Impressionist and Pointillist paintings based on their brushstrokes characteristics ZoAM GameBot: a Journey to the Lost Computational World in the Amazonia
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1