Dynamic matrix factorization-based collaborative filtering in movie recommendation services

Vuong Luong Nguyen, Trinh Quoc Vo, Hoai Thi Thuy Nguyen
{"title":"Dynamic matrix factorization-based collaborative filtering in movie recommendation services","authors":"Vuong Luong Nguyen, Trinh Quoc Vo, Hoai Thi Thuy Nguyen","doi":"10.46223/hcmcoujs.tech.en.14.1.2922.2024","DOIUrl":null,"url":null,"abstract":"Movies are a primary source of entertainment, but finding specific content can be challenging given the exponentially increasing number of movies produced each year. Recommendation systems are extremely useful for solving this problem. While various approaches exist, Collaborative Filtering (CF) is the most straightforward. CF leverages user input and historical preferences to determine user similarity and suggest movies. Matrix Factorization (MF) is one of the most popular Collaborative Filtering (CF) techniques. It maps users and items into a joint latent space, using a vector of latent features to represent each user or item. However, traditional MF techniques are static, while user cognition and product variety are constantly evolving. As a result, traditional MF approaches struggle to accommodate the dynamic nature of user-item interactions. To address this challenge, we propose a Dynamic Matrix Factorization CF model for movie recommendation systems (DMF-CF) that considers the dynamic changes in user interactions. To validate our approach, we conducted evaluations using the standard MovieLens dataset and compared it to state-of-the-art models. Our preliminary findings highlight the substantial benefits of DMF-CF, which outperforms recent models on the MovieLens-100K and MovieLens-1M datasets in terms of Mean Absolute Error (MAE) and Root Mean Squared Error (RMSE) metrics.","PeriodicalId":512408,"journal":{"name":"HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY","volume":"22 8","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46223/hcmcoujs.tech.en.14.1.2922.2024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Movies are a primary source of entertainment, but finding specific content can be challenging given the exponentially increasing number of movies produced each year. Recommendation systems are extremely useful for solving this problem. While various approaches exist, Collaborative Filtering (CF) is the most straightforward. CF leverages user input and historical preferences to determine user similarity and suggest movies. Matrix Factorization (MF) is one of the most popular Collaborative Filtering (CF) techniques. It maps users and items into a joint latent space, using a vector of latent features to represent each user or item. However, traditional MF techniques are static, while user cognition and product variety are constantly evolving. As a result, traditional MF approaches struggle to accommodate the dynamic nature of user-item interactions. To address this challenge, we propose a Dynamic Matrix Factorization CF model for movie recommendation systems (DMF-CF) that considers the dynamic changes in user interactions. To validate our approach, we conducted evaluations using the standard MovieLens dataset and compared it to state-of-the-art models. Our preliminary findings highlight the substantial benefits of DMF-CF, which outperforms recent models on the MovieLens-100K and MovieLens-1M datasets in terms of Mean Absolute Error (MAE) and Root Mean Squared Error (RMSE) metrics.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
电影推荐服务中基于动态矩阵因式分解的协同过滤技术
电影是人们娱乐的主要来源,但由于每年生产的电影数量呈指数级增长,要找到特定的电影内容非常具有挑战性。推荐系统对于解决这一问题非常有用。虽然有多种方法,但协同过滤(CF)是最直接的方法。协同过滤利用用户输入和历史偏好来确定用户相似度并推荐电影。矩阵因式分解(MF)是最流行的协同过滤(CF)技术之一。它将用户和项目映射到一个联合潜在空间,使用潜在特征向量来表示每个用户或项目。然而,传统的 MF 技术是静态的,而用户认知和产品种类是不断变化的。因此,传统的 MF 方法很难适应用户-物品交互的动态性质。为了应对这一挑战,我们提出了一种用于电影推荐系统的动态矩阵因式分解 CF 模型(DMF-CF),该模型考虑了用户交互的动态变化。为了验证我们的方法,我们使用标准的 MovieLens 数据集进行了评估,并将其与最先进的模型进行了比较。在 MovieLens-100K 和 MovieLens-1M 数据集上,DMF-CF 的平均绝对误差(MAE)和均方根误差(RMSE)指标优于最新模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hybrid knowledge-infused collaborative filtering for enhanced movie clustering and recommendation Performance comparison ensemble classifier’s performance in answering frequently asked questions about psychology Integrating BIM and computer vision for preventing Hazards at construction sites A study on constructing an efficient examination scheduling system Detecting spelling errors in Vietnamese administrative document using large language models
×
引用
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