Hierarchical Recommendation Algorithm Incorporated with Book Descriptions

Ming Xie
{"title":"Hierarchical Recommendation Algorithm Incorporated with Book Descriptions","authors":"Ming Xie","doi":"10.1109/AIAM54119.2021.00077","DOIUrl":null,"url":null,"abstract":"As more and more abundant information integrated into the recommendation system, the recommended effect is getting better and better. But not all of these side information have positive influence. For the book recommendation system, the descriptions always play the role of the first window for users to quickly overview a book. These descriptions is a kind of side information containing rich and refined semantic information. Therefore, based on the book-crossing data set, we crawls the descriptions of 107552 books, and make further recommendation by using the metapath2vec++ algorithm and LDA(Latent Dirichlet Allocation) algorithm. At the same time, aiming at the problem that users who contribute more scores are difficult to make effective recommendation in VSM(vector space model) because of the traditional vector addition method, a user similarity calculation algorithm based on the wasserstein distance is proposed, and the recommendation is based on these similar users. Through experiments, the accuracy improved 16.3% and F1 score improved 22% among the users with more than 200 rating items.","PeriodicalId":227320,"journal":{"name":"2021 3rd International Conference on Artificial Intelligence and Advanced Manufacture (AIAM)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 3rd International Conference on Artificial Intelligence and Advanced Manufacture (AIAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIAM54119.2021.00077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

As more and more abundant information integrated into the recommendation system, the recommended effect is getting better and better. But not all of these side information have positive influence. For the book recommendation system, the descriptions always play the role of the first window for users to quickly overview a book. These descriptions is a kind of side information containing rich and refined semantic information. Therefore, based on the book-crossing data set, we crawls the descriptions of 107552 books, and make further recommendation by using the metapath2vec++ algorithm and LDA(Latent Dirichlet Allocation) algorithm. At the same time, aiming at the problem that users who contribute more scores are difficult to make effective recommendation in VSM(vector space model) because of the traditional vector addition method, a user similarity calculation algorithm based on the wasserstein distance is proposed, and the recommendation is based on these similar users. Through experiments, the accuracy improved 16.3% and F1 score improved 22% among the users with more than 200 rating items.
结合图书描述的分层推荐算法
随着越来越丰富的信息融入到推荐系统中,推荐效果也越来越好。但并非所有这些附带信息都有积极的影响。对于图书推荐系统来说,描述总是作为用户快速浏览一本书的第一个窗口。这些描述是一种侧面信息,包含了丰富而精炼的语义信息。因此,基于图书交叉数据集,我们抓取了107552本图书的描述,并使用metapath2vec++算法和LDA(Latent Dirichlet Allocation)算法进行进一步推荐。同时,针对传统的向量加法方法导致贡献分数较多的用户难以在VSM(向量空间模型)中进行有效推荐的问题,提出了一种基于wasserstein距离的用户相似度计算算法,并基于这些相似用户进行推荐。通过实验,在评分项超过200个的用户中,准确率提高了16.3%,F1得分提高了22%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信