Personalized recommendation algorithm of books based on the diffusion of reader's interest

Lei Min
{"title":"Personalized recommendation algorithm of books based on the diffusion of reader's interest","authors":"Lei Min","doi":"10.1145/3573428.3573733","DOIUrl":null,"url":null,"abstract":"The ever-growing books help readers acquire knowledge faster than ever before. But the huge scale of these resources also easily makes people fall into the dilemma of \"Information-Explosion\", which prevents the reader from easily locating the books that are really suitable for them. To alleviate this dilemma, we analyzes the principle of the \"Networks-Based-Inference\" algorithm (NBI), which is a classical heuristic algorithm for recommendation. We also proposes an improved algorithm—NBI algorithm using Interest Diffusion (NBI-ID), that derives from this classical algorithm. This improved algorithm inherits the advantages of NBI method in simplicity and effectiveness, and optimizes the allocation of initial information in the process of information diffusion with an interest related indicator. Thus increasing the efficiency of the recommendation results. Experiments on the GoodBooks dataset show that the proposed algorithm improves in accuracy, recall and diversity compared to the classic NBI, CF (Collaborative Filtering) and GRM (Global Ranking Method) algorithms.","PeriodicalId":314698,"journal":{"name":"Proceedings of the 2022 6th International Conference on Electronic Information Technology and Computer Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 6th International Conference on Electronic Information Technology and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3573428.3573733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The ever-growing books help readers acquire knowledge faster than ever before. But the huge scale of these resources also easily makes people fall into the dilemma of "Information-Explosion", which prevents the reader from easily locating the books that are really suitable for them. To alleviate this dilemma, we analyzes the principle of the "Networks-Based-Inference" algorithm (NBI), which is a classical heuristic algorithm for recommendation. We also proposes an improved algorithm—NBI algorithm using Interest Diffusion (NBI-ID), that derives from this classical algorithm. This improved algorithm inherits the advantages of NBI method in simplicity and effectiveness, and optimizes the allocation of initial information in the process of information diffusion with an interest related indicator. Thus increasing the efficiency of the recommendation results. Experiments on the GoodBooks dataset show that the proposed algorithm improves in accuracy, recall and diversity compared to the classic NBI, CF (Collaborative Filtering) and GRM (Global Ranking Method) algorithms.
基于读者兴趣扩散的图书个性化推荐算法
不断增长的书籍帮助读者比以往更快地获得知识。但这些资源的庞大规模也容易使人们陷入“信息爆炸”的困境,使读者无法轻松地找到真正适合自己的书籍。为了缓解这一困境,我们分析了经典的启发式推荐算法“基于网络的推理”算法(NBI)的原理。在此基础上,提出了一种基于兴趣扩散(Interest Diffusion, NBI-ID)的改进算法nbi。该改进算法继承了NBI方法简单、有效的优点,利用兴趣相关指标对信息扩散过程中初始信息的分配进行优化。从而提高了推荐结果的效率。在GoodBooks数据集上的实验表明,与经典的NBI、CF (Collaborative Filtering)和GRM (Global Ranking Method)算法相比,该算法在准确率、查全率和多样性方面都有提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信