基于协作过滤技术的大数据推荐系统的设计与分析

Najia Khouibiri;Yousef Farhaoui;Ahmad El Allaoui
{"title":"基于协作过滤技术的大数据推荐系统的设计与分析","authors":"Najia Khouibiri;Yousef Farhaoui;Ahmad El Allaoui","doi":"10.23919/ICN.2023.0024","DOIUrl":null,"url":null,"abstract":"Online search has become very popular, and users can easily search for any movie title; however, to easily search for moving titles, users have to select a title that suits their taste. Otherwise, people will have difficulty choosing the film they want to watch. The process of choosing or searching for a film in a large film database is currently time-consuming and tedious. Users spend extensive time on the internet or on several movie viewing sites without success until they find a film that matches their taste. This happens especially because humans are confused about choosing things and quickly change their minds. Hence, the recommendation system becomes critical. This study aims to reduce user effort and facilitate the movie research task. Further, we used the root mean square error scale to evaluate and compare different models adopted in this paper. These models were employed with the aim of developing a classification model for predicting movies. Thus, we tested and evaluated several cooperative filtering techniques. We used four approaches to implement sparse matrix completion algorithms: \n<tex>$k$</tex>\n-nearest neighbors, matrix factorization, co-clustering, and slope-one.","PeriodicalId":100681,"journal":{"name":"Intelligent and Converged Networks","volume":"4 4","pages":"296-304"},"PeriodicalIF":0.0000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10379047","citationCount":"0","resultStr":"{\"title\":\"Design and Analysis of a Recommendation System Based on Collaborative Filtering Techniques for Big Data\",\"authors\":\"Najia Khouibiri;Yousef Farhaoui;Ahmad El Allaoui\",\"doi\":\"10.23919/ICN.2023.0024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online search has become very popular, and users can easily search for any movie title; however, to easily search for moving titles, users have to select a title that suits their taste. Otherwise, people will have difficulty choosing the film they want to watch. The process of choosing or searching for a film in a large film database is currently time-consuming and tedious. Users spend extensive time on the internet or on several movie viewing sites without success until they find a film that matches their taste. This happens especially because humans are confused about choosing things and quickly change their minds. Hence, the recommendation system becomes critical. This study aims to reduce user effort and facilitate the movie research task. Further, we used the root mean square error scale to evaluate and compare different models adopted in this paper. These models were employed with the aim of developing a classification model for predicting movies. Thus, we tested and evaluated several cooperative filtering techniques. We used four approaches to implement sparse matrix completion algorithms: \\n<tex>$k$</tex>\\n-nearest neighbors, matrix factorization, co-clustering, and slope-one.\",\"PeriodicalId\":100681,\"journal\":{\"name\":\"Intelligent and Converged Networks\",\"volume\":\"4 4\",\"pages\":\"296-304\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10379047\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Intelligent and Converged Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10379047/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Intelligent and Converged Networks","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10379047/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在线搜索已经变得非常普及,用户可以轻松搜索到任何电影片名;但是,要轻松搜索到动人的片名,用户必须选择适合自己口味的片名。否则,人们就很难选择自己想看的电影。目前,在大型电影数据库中选择或搜索电影的过程既耗时又繁琐。用户在互联网上或多个观影网站上花费大量时间,直到找到一部符合自己口味的电影,但却无功而返。之所以会出现这种情况,特别是因为人类在选择事物时会感到困惑,并且很快就会改变主意。因此,推荐系统变得至关重要。本研究旨在减少用户的工作量,促进电影研究任务。此外,我们使用均方根误差来评估和比较本文采用的不同模型。采用这些模型的目的是开发一种预测电影的分类模型。因此,我们测试并评估了几种合作过滤技术。我们使用了四种方法来实现稀疏矩阵补全算法:$k$-近邻、矩阵因式分解、协同聚类和斜率一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design and Analysis of a Recommendation System Based on Collaborative Filtering Techniques for Big Data
Online search has become very popular, and users can easily search for any movie title; however, to easily search for moving titles, users have to select a title that suits their taste. Otherwise, people will have difficulty choosing the film they want to watch. The process of choosing or searching for a film in a large film database is currently time-consuming and tedious. Users spend extensive time on the internet or on several movie viewing sites without success until they find a film that matches their taste. This happens especially because humans are confused about choosing things and quickly change their minds. Hence, the recommendation system becomes critical. This study aims to reduce user effort and facilitate the movie research task. Further, we used the root mean square error scale to evaluate and compare different models adopted in this paper. These models were employed with the aim of developing a classification model for predicting movies. Thus, we tested and evaluated several cooperative filtering techniques. We used four approaches to implement sparse matrix completion algorithms: $k$ -nearest neighbors, matrix factorization, co-clustering, and slope-one.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信