Hybrid collaborative filtering using matrix factorization and XGBoost for movie recommendation

IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Gopal Behera , Sanjaya Kumar Panda , Meng-Yen Hsieh , Kuan-Ching Li
{"title":"Hybrid collaborative filtering using matrix factorization and XGBoost for movie recommendation","authors":"Gopal Behera ,&nbsp;Sanjaya Kumar Panda ,&nbsp;Meng-Yen Hsieh ,&nbsp;Kuan-Ching Li","doi":"10.1016/j.csi.2024.103847","DOIUrl":null,"url":null,"abstract":"<div><p>Nowadays, e-commerce platforms, such as Amazon, Flipkart, Netflix and YouTube, extensively use recommender systems (RS) techniques. Collaborative filtering (CF) is used widely among all RS techniques. A CF analyzes the user’s preference from past data, like ratings, and then suggests actual items to the intended user. The existing techniques compute the similarity between users/items and predict the ratings. However, most of them indicate the user’s preference for the items using a single technique, which may produce poor results. This paper proposes a hybrid CF technique to enhance the movie recommendation (HCFMR). The HCFMR consists of two modules. The first module finds the prediction score with the help of matrix factorization (MF) and passes the prediction score as input to the prediction algorithm, i.e., extreme gradient boosting (XGBoost). The second module generates handcrafted features, such as similar users and movies, along with the user, item and global average. Finally, these features are supplied to the XGBoost to predict the rating score of the movie and recommend the topmost movie to the user. We conduct various simulations on real-world datasets to verify the effectiveness of the proposed technique against the baseline techniques. The exploratory outcomes signify that the HCFMR technique outperforms the baselines and provides a better prediction on the benchmark datasets.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"90 ","pages":"Article 103847"},"PeriodicalIF":4.1000,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Standards & Interfaces","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0920548924000163","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Nowadays, e-commerce platforms, such as Amazon, Flipkart, Netflix and YouTube, extensively use recommender systems (RS) techniques. Collaborative filtering (CF) is used widely among all RS techniques. A CF analyzes the user’s preference from past data, like ratings, and then suggests actual items to the intended user. The existing techniques compute the similarity between users/items and predict the ratings. However, most of them indicate the user’s preference for the items using a single technique, which may produce poor results. This paper proposes a hybrid CF technique to enhance the movie recommendation (HCFMR). The HCFMR consists of two modules. The first module finds the prediction score with the help of matrix factorization (MF) and passes the prediction score as input to the prediction algorithm, i.e., extreme gradient boosting (XGBoost). The second module generates handcrafted features, such as similar users and movies, along with the user, item and global average. Finally, these features are supplied to the XGBoost to predict the rating score of the movie and recommend the topmost movie to the user. We conduct various simulations on real-world datasets to verify the effectiveness of the proposed technique against the baseline techniques. The exploratory outcomes signify that the HCFMR technique outperforms the baselines and provides a better prediction on the benchmark datasets.

利用矩阵因式分解和 XGBoost 混合协同过滤技术推荐电影
如今,亚马逊、Flipkart、Netflix 和 YouTube 等电子商务平台广泛使用推荐系统(RS)技术。在所有推荐系统技术中,协作过滤(CF)被广泛使用。协同过滤从过去的数据(如评分)中分析用户的偏好,然后向目标用户推荐实际项目。现有技术会计算用户/项目之间的相似度,并预测评分。然而,它们大多使用单一技术来显示用户对项目的偏好,这可能会产生较差的结果。本文提出了一种增强电影推荐效果的混合 CF 技术(HCFMR)。HCFMR 由两个模块组成。第一个模块借助矩阵因式分解(MF)找到预测得分,并将预测得分作为预测算法(即极梯度提升算法(XGBoost))的输入。第二个模块生成手工制作的特征,如相似用户和电影,以及用户、项目和全局平均值。最后,这些特征被提供给 XGBoost,以预测电影的评分得分,并向用户推荐评分最高的电影。我们在真实世界的数据集上进行了各种模拟,以验证所提技术与基准技术相比的有效性。探索结果表明,在基准数据集上,HCFMR 技术的性能优于基准技术,并能提供更好的预测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Standards & Interfaces
Computer Standards & Interfaces 工程技术-计算机:软件工程
CiteScore
11.90
自引率
16.00%
发文量
67
审稿时长
6 months
期刊介绍: The quality of software, well-defined interfaces (hardware and software), the process of digitalisation, and accepted standards in these fields are essential for building and exploiting complex computing, communication, multimedia and measuring systems. Standards can simplify the design and construction of individual hardware and software components and help to ensure satisfactory interworking. Computer Standards & Interfaces is an international journal dealing specifically with these topics. The journal • Provides information about activities and progress on the definition of computer standards, software quality, interfaces and methods, at national, European and international levels • Publishes critical comments on standards and standards activities • Disseminates user''s experiences and case studies in the application and exploitation of established or emerging standards, interfaces and methods • Offers a forum for discussion on actual projects, standards, interfaces and methods by recognised experts • Stimulates relevant research by providing a specialised refereed medium.
×
引用
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学术官方微信