一种改进的正则化非负矩阵分解方法

H. Nguyen, T. Dinh
{"title":"一种改进的正则化非负矩阵分解方法","authors":"H. Nguyen, T. Dinh","doi":"10.1109/rivf.2012.6169831","DOIUrl":null,"url":null,"abstract":"This paper studies the matrix factorization technique for recommendation systems. The problem is to modify and apply non-negative matrix factorization to predict a rating that a user is likely to rate for an item in MovieLens dataset. First, based on the original randomize non-negative matrix factorization, we propose a new algorithm that discovers the features underlying the interactions between users and items. Then, in the experimentation section, we provide the numerical results of our proposed algorithms performed on the well-known MovieLens dataset. Besides, we suggest the optimization parameters which should be applied for Matrix Factorization to get good results on MovieLens. Comparison with other recent techniques in the literature shows that our algorithm is not only able to get high quality solutions but it also works well in the sparse rating domains.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Modified Regularized Non-Negative Matrix Factorization for MovieLens\",\"authors\":\"H. Nguyen, T. Dinh\",\"doi\":\"10.1109/rivf.2012.6169831\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies the matrix factorization technique for recommendation systems. The problem is to modify and apply non-negative matrix factorization to predict a rating that a user is likely to rate for an item in MovieLens dataset. First, based on the original randomize non-negative matrix factorization, we propose a new algorithm that discovers the features underlying the interactions between users and items. Then, in the experimentation section, we provide the numerical results of our proposed algorithms performed on the well-known MovieLens dataset. Besides, we suggest the optimization parameters which should be applied for Matrix Factorization to get good results on MovieLens. Comparison with other recent techniques in the literature shows that our algorithm is not only able to get high quality solutions but it also works well in the sparse rating domains.\",\"PeriodicalId\":115212,\"journal\":{\"name\":\"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/rivf.2012.6169831\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/rivf.2012.6169831","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文研究了推荐系统的矩阵分解技术。问题是修改并应用非负矩阵分解来预测用户可能对MovieLens数据集中的项目进行评分。首先,基于原始的随机非负矩阵分解,我们提出了一种新的算法来发现用户和物品之间交互的特征。然后,在实验部分,我们提供了我们提出的算法在著名的MovieLens数据集上执行的数值结果。此外,我们还提出了矩阵分解在MovieLens上得到较好效果所应采用的优化参数。与文献中其他最新技术的比较表明,我们的算法不仅能够得到高质量的解,而且在稀疏评级域中也能很好地工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Modified Regularized Non-Negative Matrix Factorization for MovieLens
This paper studies the matrix factorization technique for recommendation systems. The problem is to modify and apply non-negative matrix factorization to predict a rating that a user is likely to rate for an item in MovieLens dataset. First, based on the original randomize non-negative matrix factorization, we propose a new algorithm that discovers the features underlying the interactions between users and items. Then, in the experimentation section, we provide the numerical results of our proposed algorithms performed on the well-known MovieLens dataset. Besides, we suggest the optimization parameters which should be applied for Matrix Factorization to get good results on MovieLens. Comparison with other recent techniques in the literature shows that our algorithm is not only able to get high quality solutions but it also works well in the sparse rating domains.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信