Exploring collaborative filtering through K-Nearest Neighbors and Non-Negative Matrix Factorization

Sagedur Raman
{"title":"Exploring collaborative filtering through K-Nearest Neighbors and Non-Negative Matrix Factorization","authors":"Sagedur Raman","doi":"10.47813/2782-2818-2024-4-2-0201-0211","DOIUrl":null,"url":null,"abstract":"Collaborative filtering (CF) algorithms have received a lot of interest in recommender systems due to their ability to give personalized recommendations by exploiting user-item interaction data. In this article, we explore two popular CF methods—K-Nearest Neighbors (KNN) Regression and Non-Negative Matrix Factorization (NMF)—in detail as we dig into the world of collaborative filtering. Our goal is to evaluate their performance on the MovieLens 1M dataset and offer information about their advantages and disadvantages. A thorough explanation of the significance of recommender systems in contemporary content consumption settings is given at the outset of our examination. We look into Collaborative Filtering's complexities and how it uses user choices to produce tailored recommendations. Then, after setting the scene, we explain the KNN Regression and NMF approaches, going over their guiding principles and how they apply to recommendation systems. We conduct an extensive investigation of KNN Regression and NMF on the MovieLens 1M dataset to provide a thorough evaluation. We describe the model training processes, performance measures, and data pre-processing steps used. We measure and analyse the predicted accuracy of these strategies using empirical studies, revealing light on their effectiveness when applied to various user preferences and content categories.","PeriodicalId":508991,"journal":{"name":"Современные инновации, системы и технологии - Modern Innovations, Systems and Technologies","volume":"55 9","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Современные инновации, системы и технологии - Modern Innovations, Systems and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47813/2782-2818-2024-4-2-0201-0211","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Collaborative filtering (CF) algorithms have received a lot of interest in recommender systems due to their ability to give personalized recommendations by exploiting user-item interaction data. In this article, we explore two popular CF methods—K-Nearest Neighbors (KNN) Regression and Non-Negative Matrix Factorization (NMF)—in detail as we dig into the world of collaborative filtering. Our goal is to evaluate their performance on the MovieLens 1M dataset and offer information about their advantages and disadvantages. A thorough explanation of the significance of recommender systems in contemporary content consumption settings is given at the outset of our examination. We look into Collaborative Filtering's complexities and how it uses user choices to produce tailored recommendations. Then, after setting the scene, we explain the KNN Regression and NMF approaches, going over their guiding principles and how they apply to recommendation systems. We conduct an extensive investigation of KNN Regression and NMF on the MovieLens 1M dataset to provide a thorough evaluation. We describe the model training processes, performance measures, and data pre-processing steps used. We measure and analyse the predicted accuracy of these strategies using empirical studies, revealing light on their effectiveness when applied to various user preferences and content categories.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过 K 最近邻和非负矩阵因式分解探索协同过滤技术
协作过滤(CF)算法能够通过利用用户与项目之间的交互数据提供个性化推荐,因此在推荐系统中备受关注。在本文中,我们将详细探讨两种流行的协同过滤方法--近邻回归(KNN)和非负矩阵因式分解(NMF)--以深入了解协同过滤的世界。我们的目标是评估它们在 MovieLens 100 万数据集上的性能,并提供有关其优缺点的信息。在研究的一开始,我们就对推荐系统在当代内容消费环境中的重要性进行了详尽的解释。我们研究了协同过滤的复杂性,以及它如何利用用户的选择来生成量身定制的推荐。然后,在设定场景后,我们解释了 KNN 回归和 NMF 方法,阐述了它们的指导原则以及如何应用于推荐系统。我们在 MovieLens 100 万数据集上对 KNN 回归和 NMF 进行了广泛的调查,以提供全面的评估。我们描述了所使用的模型训练过程、性能衡量标准和数据预处理步骤。我们通过实证研究来衡量和分析这些策略的预测准确性,揭示它们在应用于各种用户偏好和内容类别时的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Model for assessing the investment attractiveness of regions Exploring collaborative filtering through K-Nearest Neighbors and Non-Negative Matrix Factorization Оптимизация пробоподготовки при определении жирнокислотного состава ультрапастеризованного молока Мобильное приложение для мониторинга и контроля климата в серверном помещении Перспективы развития электронных платёжных систем
×
引用
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