{"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.