Hybrid Movie Recommendation System With User Partitioning and Log Likelihood Content Comparison

IF 3.4 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yongmao Yang;Kampol Woradit;Kenneth Cosh
{"title":"Hybrid Movie Recommendation System With User Partitioning and Log Likelihood Content Comparison","authors":"Yongmao Yang;Kampol Woradit;Kenneth Cosh","doi":"10.1109/ACCESS.2025.3529515","DOIUrl":null,"url":null,"abstract":"fIn the domain of recommendation systems, matrix decomposition is an effective strategy for mitigating issues related to sparsity and low space utilization. The Alternating Least Squares (ALS) method, in particular, stands out for its ability to process data in parallel, thereby enhancing computational efficiency. However, when dealing with an original rating matrix, the ALS method may inadvertently sacrifice some information, leading to increased error rates. To address these challenges, this paper proposes a novel hybrid model that integrates matrix factorization with additional features. Furthermore, it leverages weighted similarity measures and employs advanced log-likelihood text mining techniques. These innovations are designed to tackle cold-start problems and sparsity issues while compensating for information loss to mitigate errors. Under the premise that our model employs consistent evaluation metrics and datasets, comparative analysis against existing models from related literature demonstrates superior performance. Specifically, our model achieves a lower Root Mean Square Error (RMSE) of 0.82 and 0.88, alongside a higher F1 score of 0.94 and 0.92 in two datasets. Our proposed hybrid approach effectively addresses sparsity and mitigates information loss in matrix factorization, as demonstrated by these results.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"13 ","pages":"11609-11622"},"PeriodicalIF":3.4000,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10840180","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10840180/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

fIn the domain of recommendation systems, matrix decomposition is an effective strategy for mitigating issues related to sparsity and low space utilization. The Alternating Least Squares (ALS) method, in particular, stands out for its ability to process data in parallel, thereby enhancing computational efficiency. However, when dealing with an original rating matrix, the ALS method may inadvertently sacrifice some information, leading to increased error rates. To address these challenges, this paper proposes a novel hybrid model that integrates matrix factorization with additional features. Furthermore, it leverages weighted similarity measures and employs advanced log-likelihood text mining techniques. These innovations are designed to tackle cold-start problems and sparsity issues while compensating for information loss to mitigate errors. Under the premise that our model employs consistent evaluation metrics and datasets, comparative analysis against existing models from related literature demonstrates superior performance. Specifically, our model achieves a lower Root Mean Square Error (RMSE) of 0.82 and 0.88, alongside a higher F1 score of 0.94 and 0.92 in two datasets. Our proposed hybrid approach effectively addresses sparsity and mitigates information loss in matrix factorization, as demonstrated by these results.
基于用户划分和日志似然内容比较的混合电影推荐系统
在推荐系统领域,矩阵分解是缓解稀疏性和低空间利用率问题的有效策略。交替最小二乘(ALS)方法尤其以其并行处理数据的能力而脱颖而出,从而提高了计算效率。然而,在处理原始评级矩阵时,ALS方法可能会在无意中牺牲一些信息,导致错误率增加。为了解决这些问题,本文提出了一种将矩阵分解与附加特征相结合的新型混合模型。此外,它利用加权相似度度量并采用先进的对数似然文本挖掘技术。这些创新旨在解决冷启动问题和稀疏性问题,同时补偿信息丢失以减少错误。在我们的模型采用一致的评价指标和数据集的前提下,与相关文献中已有模型的对比分析表明,我们的模型具有更优的性能。具体来说,我们的模型在两个数据集中实现了较低的均方根误差(RMSE),分别为0.82和0.88,以及较高的F1分数,分别为0.94和0.92。这些结果表明,我们提出的混合方法有效地解决了矩阵分解中的稀疏性并减轻了信息损失。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Access
IEEE Access COMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍: IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest. IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on: Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals. Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering. Development of new or improved fabrication or manufacturing techniques. Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.
×
引用
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学术官方微信