一种基于项目聚类的协同过滤方法

Hao-jun Sun, Tao Wu, Meijuan Yan, Yunxia Wu
{"title":"一种基于项目聚类的协同过滤方法","authors":"Hao-jun Sun, Tao Wu, Meijuan Yan, Yunxia Wu","doi":"10.1109/WISA.2012.30","DOIUrl":null,"url":null,"abstract":"With the rapid development of E-commerce, people can get information easily from networks and customers have more choices, but at the same time it brings other problems. The vast amounts of information increase the burden for customers to purchase, they have to browse more unrelated information, and increase the time spent. To solve this problem and guide the customers' purchase in E-commerce, there needs to be an auto promotion system to help customers. In this research, we discuss the traditional collaborative filtering algorithm's, and propose a new item clustering-based collaborative filtering approach (ICSCFA). At first, the approach employs clustering items by support to decrease the nearest-neighbour space, and then gives the prediction of rate. The experiments have proven that the new approach increases the quality of clustering and is effective in relieving the extremely sparse customer rated matrix problem, enhancing the recommendation system's accuracy of prediction.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A New Item Clustering-Based Collaborative Filtering Approach\",\"authors\":\"Hao-jun Sun, Tao Wu, Meijuan Yan, Yunxia Wu\",\"doi\":\"10.1109/WISA.2012.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid development of E-commerce, people can get information easily from networks and customers have more choices, but at the same time it brings other problems. The vast amounts of information increase the burden for customers to purchase, they have to browse more unrelated information, and increase the time spent. To solve this problem and guide the customers' purchase in E-commerce, there needs to be an auto promotion system to help customers. In this research, we discuss the traditional collaborative filtering algorithm's, and propose a new item clustering-based collaborative filtering approach (ICSCFA). At first, the approach employs clustering items by support to decrease the nearest-neighbour space, and then gives the prediction of rate. The experiments have proven that the new approach increases the quality of clustering and is effective in relieving the extremely sparse customer rated matrix problem, enhancing the recommendation system's accuracy of prediction.\",\"PeriodicalId\":313228,\"journal\":{\"name\":\"2012 Ninth Web Information Systems and Applications Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Ninth Web Information Systems and Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WISA.2012.30\",\"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 Ninth Web Information Systems and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISA.2012.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

随着电子商务的快速发展,人们可以方便地从网络上获取信息,消费者有了更多的选择,但同时也带来了其他问题。海量的信息增加了顾客购买的负担,他们不得不浏览更多不相关的信息,增加了花费的时间。为了解决这一问题,引导客户在电子商务中购买,需要有一个自动促销系统来帮助客户。在讨论传统协同过滤算法的基础上,提出了一种新的基于项目聚类的协同过滤方法。该方法首先采用支持度聚类方法减小最近邻空间,然后给出预测率。实验证明,该方法提高了聚类质量,有效地缓解了极度稀疏的顾客评价矩阵问题,提高了推荐系统的预测精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A New Item Clustering-Based Collaborative Filtering Approach
With the rapid development of E-commerce, people can get information easily from networks and customers have more choices, but at the same time it brings other problems. The vast amounts of information increase the burden for customers to purchase, they have to browse more unrelated information, and increase the time spent. To solve this problem and guide the customers' purchase in E-commerce, there needs to be an auto promotion system to help customers. In this research, we discuss the traditional collaborative filtering algorithm's, and propose a new item clustering-based collaborative filtering approach (ICSCFA). At first, the approach employs clustering items by support to decrease the nearest-neighbour space, and then gives the prediction of rate. The experiments have proven that the new approach increases the quality of clustering and is effective in relieving the extremely sparse customer rated matrix problem, enhancing the recommendation system's accuracy of prediction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolutionary Analysis of Operation System-of-Systems (SoS) Network Based on Simulated Data Research of Cache Mechanism in Mobile Data Management OpinMiner: Extracting Feature-Opinion Pairs with Dependency Grammar from Chinese Product Reviews A Deep Web Database Sampling Method Based on High Correlation Keywords Richly Semantical Keyword Searching over Relational Databases
×
引用
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