Tailored Graph Embeddings for Entity Alignment on Historical Data

J. Baas, M. Dastani, A. Feelders
{"title":"Tailored Graph Embeddings for Entity Alignment on Historical Data","authors":"J. Baas, M. Dastani, A. Feelders","doi":"10.1145/3428757.3429111","DOIUrl":null,"url":null,"abstract":"In the domain of the Dutch cultural heritage various data sets describe different aspects of life during the Dutch Golden Age. These data sets, in the form of RDF graphs, use different standards and contain noise in the values of literal nodes, such as misspelled names and uncertainty in dates. The Golden Agents project aims at answering queries about the Dutch Golden ages using these distributed and independently maintained data sets. A problem in this project, among many other problems, is the identification of persons who occur in multiple data sets but under different URI's. This paper aims to solve this specific problem and generate a linkset, i.e. a set of pairs of URI's which are judged to represent the same person. We use domain knowledge in the application of an existing node context generation algorithm to serve as input for GloVe, an algorithm originally designed for embedding words. This embedding is then used to train a classifier on pairs of URI's which are known duplicates and non-duplicates. Using just the cosine similarity between URI-pairs in embedding space for prediction, we obtain a simple classifier with an F½-score of around 0.85, even when very few training examples are provided. On larger training sets, more complex classifiers are shown to reach an F½-score of up to 0.88.","PeriodicalId":212557,"journal":{"name":"Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3428757.3429111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In the domain of the Dutch cultural heritage various data sets describe different aspects of life during the Dutch Golden Age. These data sets, in the form of RDF graphs, use different standards and contain noise in the values of literal nodes, such as misspelled names and uncertainty in dates. The Golden Agents project aims at answering queries about the Dutch Golden ages using these distributed and independently maintained data sets. A problem in this project, among many other problems, is the identification of persons who occur in multiple data sets but under different URI's. This paper aims to solve this specific problem and generate a linkset, i.e. a set of pairs of URI's which are judged to represent the same person. We use domain knowledge in the application of an existing node context generation algorithm to serve as input for GloVe, an algorithm originally designed for embedding words. This embedding is then used to train a classifier on pairs of URI's which are known duplicates and non-duplicates. Using just the cosine similarity between URI-pairs in embedding space for prediction, we obtain a simple classifier with an F½-score of around 0.85, even when very few training examples are provided. On larger training sets, more complex classifiers are shown to reach an F½-score of up to 0.88.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
历史数据实体对齐的定制图嵌入
在荷兰文化遗产领域,各种数据集描述了荷兰黄金时代生活的不同方面。这些数据集以RDF图的形式使用不同的标准,并且在文字节点的值中包含噪声,例如拼写错误的名称和日期中的不确定性。Golden Agents项目旨在利用这些分布式且独立维护的数据集回答有关荷兰黄金时代的问题。在许多其他问题中,这个项目中的一个问题是识别出现在多个数据集中但使用不同URI的人员。本文旨在解决这一特定问题,并生成一个链接集,即一组被判断为代表同一个人的URI对的集合。我们在现有节点上下文生成算法的应用中使用领域知识作为GloVe的输入,GloVe是一种最初设计用于嵌入单词的算法。然后使用这种嵌入在已知的重复和非重复的URI对上训练分类器。仅使用嵌入空间中uri对之间的余弦相似度进行预测,我们获得了一个F½-分数约为0.85的简单分类器,即使提供的训练示例非常少。在更大的训练集上,更复杂的分类器可以达到高达0.88的F½-分数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Tailored Graph Embeddings for Entity Alignment on Historical Data CommunityCare A Comparison of Two Database Partitioning Approaches that Support Taxonomy-Based Query Answering Prediction of Cesarean Childbirth using Ensemble Machine Learning Methods Interoperability of Semantically-Enabled Web Services on the WoT: Challenges and Prospects
×
引用
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