Explainable Meta-Path Based Recommender Systems

Thanet Markchom, Huizhi Liang, James Ferryman
{"title":"Explainable Meta-Path Based Recommender Systems","authors":"Thanet Markchom, Huizhi Liang, James Ferryman","doi":"10.1145/3625828","DOIUrl":null,"url":null,"abstract":"Meta-paths have been popularly used to provide explainability in recommendations. Although long/complicated meta-paths could represent complex user-item connectivity, they are not easy to interpret. This work tackles this problem by introducing a meta-path translation task. The objective is to translate a meta-path to its comparable explainable meta-paths that perform similarly in terms of recommendation but have higher explainability compared to the given one. We propose a definition of meta-path explainability to determine comparable explainable meta-paths and a meta-path grammar that allows comparable explainable meta-paths to be formed in a similar way as sentences in human languages. Based on this grammar, we propose a meta-path translation model, a sequence-to-sequence (Seq2Seq) model to translate a long and complicated meta-path to its comparable explainable meta-paths. Two novel datasets for meta-path translation were generated based on two real-world recommendation datasets. The experiments were conducted on these generated datasets. The results show that our model outperformed state-of-the-art Seq2Seq baselines regarding meta-path translation and maintained a better trade-off between accuracy and diversity/readability in predicting comparable explainable meta-paths. These results indicate that our model can effectively generate a group of explainable meta-paths as alternative explanations for those recommendations based on any given long/complicated meta-path.","PeriodicalId":474833,"journal":{"name":"ACM Transactions on Recommender Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Recommender Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3625828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Meta-paths have been popularly used to provide explainability in recommendations. Although long/complicated meta-paths could represent complex user-item connectivity, they are not easy to interpret. This work tackles this problem by introducing a meta-path translation task. The objective is to translate a meta-path to its comparable explainable meta-paths that perform similarly in terms of recommendation but have higher explainability compared to the given one. We propose a definition of meta-path explainability to determine comparable explainable meta-paths and a meta-path grammar that allows comparable explainable meta-paths to be formed in a similar way as sentences in human languages. Based on this grammar, we propose a meta-path translation model, a sequence-to-sequence (Seq2Seq) model to translate a long and complicated meta-path to its comparable explainable meta-paths. Two novel datasets for meta-path translation were generated based on two real-world recommendation datasets. The experiments were conducted on these generated datasets. The results show that our model outperformed state-of-the-art Seq2Seq baselines regarding meta-path translation and maintained a better trade-off between accuracy and diversity/readability in predicting comparable explainable meta-paths. These results indicate that our model can effectively generate a group of explainable meta-paths as alternative explanations for those recommendations based on any given long/complicated meta-path.
基于可解释元路径的推荐系统
元路径已被广泛用于在推荐中提供可解释性。尽管长/复杂的元路径可以表示复杂的用户-项目连接,但它们并不容易解释。这项工作通过引入元路径翻译任务来解决这个问题。目标是将元路径转换为可解释的元路径,这些元路径在推荐方面执行相似,但与给定的元路径相比具有更高的可解释性。我们提出了元路径可解释性的定义,以确定可比的可解释元路径和元路径语法,允许以类似于人类语言句子的方式形成可比的可解释元路径。基于这种语法,我们提出了一个元路径翻译模型,一个序列到序列(Seq2Seq)模型,用于将长而复杂的元路径转换为可解释的元路径。基于两个现实世界的推荐数据集,生成了两个新的元路径翻译数据集。实验在这些生成的数据集上进行。结果表明,我们的模型在元路径翻译方面优于最先进的Seq2Seq基线,并且在预测可解释元路径的准确性和多样性/可读性之间保持了更好的平衡。这些结果表明,我们的模型可以有效地生成一组可解释的元路径,作为基于任何给定的长/复杂元路径的推荐的替代解释。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书