Improve ranking algorithms based on matrix factorization in rating systems

IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Shuyan Chen , Shengli Zhang , Gengzhong Zheng
{"title":"Improve ranking algorithms based on matrix factorization in rating systems","authors":"Shuyan Chen ,&nbsp;Shengli Zhang ,&nbsp;Gengzhong Zheng","doi":"10.1016/j.patcog.2025.112011","DOIUrl":null,"url":null,"abstract":"<div><div>The proliferation of the Internet has led to an increase in the usage of rating systems. Inspired by matrix factorization, we present two improved iterative ranking algorithms called L1-AVG-RMF and AA-RMF for rating systems. In the new algorithms, the missing ratings are estimated by matrix factorization before applying traditional ranking algorithms. Theoretical analysis illustrates that the proposed algorithms have a better accuracy and robustness. And it is also demonstrated by Experiments with synthetic and real data. Additionally, experimental results also show that L1-AVG-RMF has superior effectiveness and robustness compared to some other ranking algorithms. Our findings emphasize the potential benefits of applying matrix factorization to ranking algorithms.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"170 ","pages":"Article 112011"},"PeriodicalIF":7.5000,"publicationDate":"2025-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325006715","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The proliferation of the Internet has led to an increase in the usage of rating systems. Inspired by matrix factorization, we present two improved iterative ranking algorithms called L1-AVG-RMF and AA-RMF for rating systems. In the new algorithms, the missing ratings are estimated by matrix factorization before applying traditional ranking algorithms. Theoretical analysis illustrates that the proposed algorithms have a better accuracy and robustness. And it is also demonstrated by Experiments with synthetic and real data. Additionally, experimental results also show that L1-AVG-RMF has superior effectiveness and robustness compared to some other ranking algorithms. Our findings emphasize the potential benefits of applying matrix factorization to ranking algorithms.
改进评级系统中基于矩阵分解的排名算法
互联网的普及导致了评级系统使用的增加。受矩阵分解的启发,我们提出了两种改进的迭代排序算法L1-AVG-RMF和AA-RMF。在新算法中,在使用传统排序算法之前,先通过矩阵分解对缺失等级进行估计。理论分析表明,该算法具有较好的精度和鲁棒性。并通过综合数据和实际数据进行了实验验证。此外,实验结果还表明,L1-AVG-RMF与其他一些排序算法相比具有更好的有效性和鲁棒性。我们的研究结果强调了将矩阵分解应用于排名算法的潜在好处。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Pattern Recognition
Pattern Recognition 工程技术-工程:电子与电气
CiteScore
14.40
自引率
16.20%
发文量
683
审稿时长
5.6 months
期刊介绍: The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信