An Approach Based on Semantic Similarity to Explaining Link Predictions on Knowledge Graphs

Claudia d’Amato, Pierpaolo Masella, N. Fanizzi
{"title":"An Approach Based on Semantic Similarity to Explaining Link Predictions on Knowledge Graphs","authors":"Claudia d’Amato, Pierpaolo Masella, N. Fanizzi","doi":"10.1145/3486622.3493956","DOIUrl":null,"url":null,"abstract":"We propose approxSemanticCrossE, an approach for generating explanations to link prediction problems on Knowledge Graphs. Due to their incompleteness, several models have been proposed to predict missing relationships (link prediction task). To date, the most effective methods are based on embedding models, representing entities and relationships as a multi-dimensional vectors in a vector space. Explaining the results of this task means finding a meaningful reason for which entities are predicted as linked. This work presents a structural and semantically enriched approach for generating explanations for link predictions, by exploring the data available in the knowledge graph. The solution searches for paths and examples of similar situations that justify the prediction carried out using numerical approaches. Specifically, CrossE is adopted as the underlying embedding model to compute predictions. Then explanations are searched exploiting ad hoc semantic similarity measures. The proposed solution has been experimentally evaluated, showing that the new approach is able to provide meaningful explanations compared to the considered baseline.","PeriodicalId":89230,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"119 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3486622.3493956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

We propose approxSemanticCrossE, an approach for generating explanations to link prediction problems on Knowledge Graphs. Due to their incompleteness, several models have been proposed to predict missing relationships (link prediction task). To date, the most effective methods are based on embedding models, representing entities and relationships as a multi-dimensional vectors in a vector space. Explaining the results of this task means finding a meaningful reason for which entities are predicted as linked. This work presents a structural and semantically enriched approach for generating explanations for link predictions, by exploring the data available in the knowledge graph. The solution searches for paths and examples of similar situations that justify the prediction carried out using numerical approaches. Specifically, CrossE is adopted as the underlying embedding model to compute predictions. Then explanations are searched exploiting ad hoc semantic similarity measures. The proposed solution has been experimentally evaluated, showing that the new approach is able to provide meaningful explanations compared to the considered baseline.
基于语义相似度的知识图链接预测解释方法
我们提出了近似语义交叉,这是一种生成解释的方法,用于在知识图上链接预测问题。由于其不完备性,人们提出了几种模型来预测缺失关系(链接预测任务)。迄今为止,最有效的方法是基于嵌入模型,将实体和关系表示为向量空间中的多维向量。解释这个任务的结果意味着找到一个有意义的原因,为什么实体被预测为链接。这项工作提出了一种结构和语义丰富的方法,通过探索知识图中的可用数据,为链接预测生成解释。该解决方案搜索路径和类似情况的例子,证明使用数值方法进行的预测是正确的。具体而言,采用CrossE作为底层嵌入模型来计算预测。然后利用特殊的语义相似度度量来搜索解释。提出的解决方案已经过实验评估,表明与考虑的基线相比,新方法能够提供有意义的解释。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信