基于知识图谱的贝叶斯个性化排名

Ran Ma, Xiaotian Yang, Jiang Li, Fei Gao
{"title":"基于知识图谱的贝叶斯个性化排名","authors":"Ran Ma, Xiaotian Yang, Jiang Li, Fei Gao","doi":"10.1145/3581807.3581887","DOIUrl":null,"url":null,"abstract":"Collaborative filtering algorithms have serious data sparsity and cold start problems as the amount of data increases and the movie dataset keeps growing.To solve the above problems, this paper proposes to combine the knowledge graph with Matrix factorization algorithm.Through the user's historical interests, mining the user's similar interests on the knowledge graph, to form the candidate items, useing eventually to predict users' interests, and finally using Bayesian personalized recommendation to predict the user's rating of the candidate items to achieve top-K recommendation.Through experiments, it is demonstrated that the algorithm proposed in this paper significantly improves the recommendation effect of matrix decomposition model. With its AUC=0.9348 and ACC=0.8474 on the movie dataset, the experimental data show that the algorithm can improve the recommendation effect more effectively.","PeriodicalId":292813,"journal":{"name":"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bayesian Personalized Ranking based on Knowledge Graph\",\"authors\":\"Ran Ma, Xiaotian Yang, Jiang Li, Fei Gao\",\"doi\":\"10.1145/3581807.3581887\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaborative filtering algorithms have serious data sparsity and cold start problems as the amount of data increases and the movie dataset keeps growing.To solve the above problems, this paper proposes to combine the knowledge graph with Matrix factorization algorithm.Through the user's historical interests, mining the user's similar interests on the knowledge graph, to form the candidate items, useing eventually to predict users' interests, and finally using Bayesian personalized recommendation to predict the user's rating of the candidate items to achieve top-K recommendation.Through experiments, it is demonstrated that the algorithm proposed in this paper significantly improves the recommendation effect of matrix decomposition model. With its AUC=0.9348 and ACC=0.8474 on the movie dataset, the experimental data show that the algorithm can improve the recommendation effect more effectively.\",\"PeriodicalId\":292813,\"journal\":{\"name\":\"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3581807.3581887\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3581807.3581887","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着数据量的增加和电影数据集的不断增长,协同过滤算法存在严重的数据稀疏性和冷启动问题。为了解决上述问题,本文提出将知识图与矩阵分解算法相结合。通过用户的历史兴趣,挖掘用户在知识图上的相似兴趣,形成候选项目,利用最终预测用户的兴趣,最后利用贝叶斯个性化推荐预测用户对候选项目的评分,实现top-K推荐。通过实验证明,本文提出的算法显著提高了矩阵分解模型的推荐效果。实验数据表明,该算法在电影数据集上的AUC=0.9348, ACC=0.8474,可以更有效地提高推荐效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Bayesian Personalized Ranking based on Knowledge Graph
Collaborative filtering algorithms have serious data sparsity and cold start problems as the amount of data increases and the movie dataset keeps growing.To solve the above problems, this paper proposes to combine the knowledge graph with Matrix factorization algorithm.Through the user's historical interests, mining the user's similar interests on the knowledge graph, to form the candidate items, useing eventually to predict users' interests, and finally using Bayesian personalized recommendation to predict the user's rating of the candidate items to achieve top-K recommendation.Through experiments, it is demonstrated that the algorithm proposed in this paper significantly improves the recommendation effect of matrix decomposition model. With its AUC=0.9348 and ACC=0.8474 on the movie dataset, the experimental data show that the algorithm can improve the recommendation effect more effectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-Scale Channel Attention for Chinese Scene Text Recognition Vehicle Re-identification Based on Multi-Scale Attention Feature Fusion Comparative Study on EEG Feature Recognition based on Deep Belief Network VA-TransUNet: A U-shaped Medical Image Segmentation Network with Visual Attention Traffic Flow Forecasting Research Based on Delay Reconstruction and GRU-SVR
×
引用
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