Accuracy analysis of recommendation system using singular value decomposition

Naznin Akter, A. S. Hoque, Rashed Mustafa, M. S. Chowdhury
{"title":"Accuracy analysis of recommendation system using singular value decomposition","authors":"Naznin Akter, A. S. Hoque, Rashed Mustafa, M. S. Chowdhury","doi":"10.1109/ICCITECHN.2016.7860232","DOIUrl":null,"url":null,"abstract":"Recommendation systems use utility matrix to represent the user ratings for a particular items. But that matrix is sparse, that is, most of the user ratings are unknown. Predicting those unknown ratings is a big challenge of recommendation data mining task. Due to the sparse of data in utility matrix, few features become less important. Those features should be reduced to decline the computational complexity. Singular Value Decomposition (SVD) is a most powerful algorithm to predict unknown ratings by reducing the less significant features. Before applying SVD on utility matrix, all unknown ratings should be filled with some initial values. This paper focuses to generate two predictive matrixes by assigning two different initial values, where one is Zero and other is replacing unknown values with average item rating and then subtracting corresponding average user rating from the values. The accuracy of forecasted ratings has been justified over a sample dataset in this paper as well.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 19th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2016.7860232","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Recommendation systems use utility matrix to represent the user ratings for a particular items. But that matrix is sparse, that is, most of the user ratings are unknown. Predicting those unknown ratings is a big challenge of recommendation data mining task. Due to the sparse of data in utility matrix, few features become less important. Those features should be reduced to decline the computational complexity. Singular Value Decomposition (SVD) is a most powerful algorithm to predict unknown ratings by reducing the less significant features. Before applying SVD on utility matrix, all unknown ratings should be filled with some initial values. This paper focuses to generate two predictive matrixes by assigning two different initial values, where one is Zero and other is replacing unknown values with average item rating and then subtracting corresponding average user rating from the values. The accuracy of forecasted ratings has been justified over a sample dataset in this paper as well.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于奇异值分解的推荐系统精度分析
推荐系统使用效用矩阵来表示用户对特定项目的评分。但是这个矩阵是稀疏的,也就是说,大多数用户的评分是未知的。预测这些未知的评级是推荐数据挖掘任务的一大挑战。由于效用矩阵中数据的稀疏性,一些特征变得不那么重要。应该减少这些特征以降低计算复杂度。奇异值分解(SVD)是一种通过减少不太重要的特征来预测未知评级的最强大的算法。在对效用矩阵应用奇异值分解之前,所有未知的评级都应该用一些初始值填充。本文的重点是通过分配两个不同的初始值来生成两个预测矩阵,其中一个是0,另一个是用平均物品评分替换未知值,然后减去相应的平均用户评分。预测评级的准确性也在本文的样本数据集上得到了证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Modeling of solar photovoltaic system using MATLAB/Simulink Traffic sign recognition using hybrid features descriptor and artificial neural network classifier Accuracy analysis of recommendation system using singular value decomposition Performance analysis of supervised machine learning algorithms for text classification Fatigue testing of MEMS device developed by MetalMUMPs fabrication process
×
引用
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