一种改进的覆盖约简协同过滤流行项提取方法

A. Roko, Umar Muhammad Bello, Abba Almu
{"title":"一种改进的覆盖约简协同过滤流行项提取方法","authors":"A. Roko, Umar Muhammad Bello, Abba Almu","doi":"10.5815/ijigsp.2022.04.03","DOIUrl":null,"url":null,"abstract":": Recommender Systems are systems that aid users in finding relevant items, products, or services, usually in an online setting. Collaborative Filtering is the most popular approach for building recommender system due to its superior performance. There are several collaborative filtering methods developed, however, all of them have an inherent problem of data sparsity. Covering Reduction Collaborative Filtering (CRCF) is a new collaborative filtering method developed to solve the problem. CRCF has a key feature called popular items extraction algorithm which produces a list of items with the most ratings, however, the algorithm fails in a denser dataset because it allows any item to be in the list. Likewise, the algorithm does not consider the rating values of items while considering the popular items. These make it to produce less accurate recommendation. This research extends CRCF by developing a new popular item extraction algorithm that removes items with low modal ratings and similarly utilizes the rating values in considering the popular items. This newly developed method is incorporated in CRCF and the new method is called Improved Popular Items Extraction for Covering Reduction Collaborative Filtering (ICRCF). Experiment was conducted on Movielens-1M and Movielens-10M datasets using precision, recall and f1-score as performance metrics. The result of the experiment shows that the new method, ICRCF provides a better recommendation than the base method CRCF in all the performance metrics. Furthermore, the new method is able to perform well both at higher and lower levels of sparsity.","PeriodicalId":378340,"journal":{"name":"International Journal of Image, Graphics and Signal Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Popular Items Extraction for Covering Reduction Collaborative Filtering\",\"authors\":\"A. Roko, Umar Muhammad Bello, Abba Almu\",\"doi\":\"10.5815/ijigsp.2022.04.03\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": Recommender Systems are systems that aid users in finding relevant items, products, or services, usually in an online setting. Collaborative Filtering is the most popular approach for building recommender system due to its superior performance. There are several collaborative filtering methods developed, however, all of them have an inherent problem of data sparsity. Covering Reduction Collaborative Filtering (CRCF) is a new collaborative filtering method developed to solve the problem. CRCF has a key feature called popular items extraction algorithm which produces a list of items with the most ratings, however, the algorithm fails in a denser dataset because it allows any item to be in the list. Likewise, the algorithm does not consider the rating values of items while considering the popular items. These make it to produce less accurate recommendation. This research extends CRCF by developing a new popular item extraction algorithm that removes items with low modal ratings and similarly utilizes the rating values in considering the popular items. This newly developed method is incorporated in CRCF and the new method is called Improved Popular Items Extraction for Covering Reduction Collaborative Filtering (ICRCF). Experiment was conducted on Movielens-1M and Movielens-10M datasets using precision, recall and f1-score as performance metrics. The result of the experiment shows that the new method, ICRCF provides a better recommendation than the base method CRCF in all the performance metrics. Furthermore, the new method is able to perform well both at higher and lower levels of sparsity.\",\"PeriodicalId\":378340,\"journal\":{\"name\":\"International Journal of Image, Graphics and Signal Processing\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Image, Graphics and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5815/ijigsp.2022.04.03\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Image, Graphics and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5815/ijigsp.2022.04.03","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

推荐系统是帮助用户查找相关项目、产品或服务的系统,通常在在线设置中。协同过滤以其优越的性能成为构建推荐系统最常用的方法。目前已经开发了几种协同过滤方法,但它们都存在固有的数据稀疏性问题。覆盖约简协同过滤(CRCF)是为了解决这一问题而发展起来的一种新的协同过滤方法。CRCF有一个关键特性,称为流行项目提取算法,它产生具有最多评级的项目列表,然而,该算法在更密集的数据集中失败,因为它允许任何项目在列表中。同样,该算法在考虑热门商品时也不考虑商品的评分值。这使得它产生的推荐不太准确。本研究通过开发一种新的流行物品提取算法来扩展CRCF,该算法可以删除低模态评分的物品,并类似地利用评分值来考虑流行物品。将该方法引入到CRCF中,称为覆盖约简协同过滤的改进流行项提取(ICRCF)。实验在Movielens-1M和Movielens-10M数据集上进行,以精度、召回率和f1-score作为性能指标。实验结果表明,新方法ICRCF在所有性能指标上都比基本方法CRCF提供了更好的推荐。此外,新方法在高稀疏度和低稀疏度水平下都能表现良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Popular Items Extraction for Covering Reduction Collaborative Filtering
: Recommender Systems are systems that aid users in finding relevant items, products, or services, usually in an online setting. Collaborative Filtering is the most popular approach for building recommender system due to its superior performance. There are several collaborative filtering methods developed, however, all of them have an inherent problem of data sparsity. Covering Reduction Collaborative Filtering (CRCF) is a new collaborative filtering method developed to solve the problem. CRCF has a key feature called popular items extraction algorithm which produces a list of items with the most ratings, however, the algorithm fails in a denser dataset because it allows any item to be in the list. Likewise, the algorithm does not consider the rating values of items while considering the popular items. These make it to produce less accurate recommendation. This research extends CRCF by developing a new popular item extraction algorithm that removes items with low modal ratings and similarly utilizes the rating values in considering the popular items. This newly developed method is incorporated in CRCF and the new method is called Improved Popular Items Extraction for Covering Reduction Collaborative Filtering (ICRCF). Experiment was conducted on Movielens-1M and Movielens-10M datasets using precision, recall and f1-score as performance metrics. The result of the experiment shows that the new method, ICRCF provides a better recommendation than the base method CRCF in all the performance metrics. Furthermore, the new method is able to perform well both at higher and lower levels of sparsity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信