A Study on the Improved Collaborative Filtering Algorithm for Recommender System

Hee-Choon Lee, S. Lee, Y. Chung
{"title":"A Study on the Improved Collaborative Filtering Algorithm for Recommender System","authors":"Hee-Choon Lee, S. Lee, Y. Chung","doi":"10.1109/SERA.2007.33","DOIUrl":null,"url":null,"abstract":"The purpose of this study is to suggest an algorithm of a recommender system to increase the customer's desire of purchasing, by automatically recommending goods transacted on e-commerce to customers. The recommender system has various filtering techniques according to the methods of recommendation. In this study, researchers study collaborative filtering among recommender systems. The accuracy of customer's preference prediction is compared with the accuracy of customer's preference prediction of the existing collaborative filtering algorithm, and the suggested new algorithm. At first, the accuracy of a customer's preference prediction of neighborhood based algorithm as automated collaborative filtering algorithm firstly & correspondence mean algorithm, is compared. It is analyzed by using MovieLens1 100K dataset and I Million dataset in order to experiment with the prediction accuracy of the each algorithm. For similarity weight used in both algorithms it is discovered Pearson's correlation coefficient and vector similarity which are generally used were utilized, and as a result of analysis, we show that the accuracy of the customer's preference prediction of correspondence mean algorithm is superior. Pearson's correlation coefficient and vector similarity used in two algorithms are calculated by using the preference rating of two customers' co-rated movies, and it shows that similarity weight is overestimated, where the number of co-rated movies is small. Therefore, it is intended to increase the accuracy of customer's preference prediction through expanding the effect of the number of the existing co-rated movies.","PeriodicalId":181543,"journal":{"name":"5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SERA.2007.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

The purpose of this study is to suggest an algorithm of a recommender system to increase the customer's desire of purchasing, by automatically recommending goods transacted on e-commerce to customers. The recommender system has various filtering techniques according to the methods of recommendation. In this study, researchers study collaborative filtering among recommender systems. The accuracy of customer's preference prediction is compared with the accuracy of customer's preference prediction of the existing collaborative filtering algorithm, and the suggested new algorithm. At first, the accuracy of a customer's preference prediction of neighborhood based algorithm as automated collaborative filtering algorithm firstly & correspondence mean algorithm, is compared. It is analyzed by using MovieLens1 100K dataset and I Million dataset in order to experiment with the prediction accuracy of the each algorithm. For similarity weight used in both algorithms it is discovered Pearson's correlation coefficient and vector similarity which are generally used were utilized, and as a result of analysis, we show that the accuracy of the customer's preference prediction of correspondence mean algorithm is superior. Pearson's correlation coefficient and vector similarity used in two algorithms are calculated by using the preference rating of two customers' co-rated movies, and it shows that similarity weight is overestimated, where the number of co-rated movies is small. Therefore, it is intended to increase the accuracy of customer's preference prediction through expanding the effect of the number of the existing co-rated movies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
推荐系统中改进的协同过滤算法研究
本研究的目的是提出一种推荐系统的算法,通过自动推荐在电子商务上交易的商品给顾客,从而增加顾客的购买欲望。根据推荐的方法,推荐系统采用了多种过滤技术。在本研究中,研究人员研究了推荐系统之间的协同过滤。将顾客偏好预测的精度与现有协同过滤算法的顾客偏好预测精度进行了比较,并提出了新算法。首先比较了邻域算法与自动协同过滤算法和对应均值算法对顾客偏好预测的准确性。通过使用MovieLens1 100K数据集和I Million数据集对其进行分析,以验证每种算法的预测精度。对于两种算法中使用的相似度权重,发现使用了常用的Pearson相关系数和向量相似度,分析结果表明对应均值算法对顾客偏好的预测精度更高。两种算法中使用的Pearson相关系数和向量相似度都是通过对两个客户共同评价的电影的偏好评分来计算的,结果表明,在共同评价的电影数量较少的情况下,相似度权重被高估了。因此,本研究旨在通过扩大现有共同评分电影数量的影响,来提高顾客偏好预测的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Keynote Address 1 Keynote Address 2 A Preliminary Formal Specification of Virtual Organization Creation with RAISE Specification Language Efficient User Support with DACS Scheme A Framework for the Use of Six Sigma Tools in PSP/TSP
×
引用
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