预测集优化协同过滤

Orsolya Horvath, G. Takács
{"title":"预测集优化协同过滤","authors":"Orsolya Horvath, G. Takács","doi":"10.1109/IDAACS.2011.6072784","DOIUrl":null,"url":null,"abstract":"One of the most efficient approaches to create a recommender system is collaborative filtering (CF). CF does not require metadata about users and items, but only interactions between users and items (e.g. ratings), therefore it can be applied in many problem domains. Experience shows that for achieving high accuracy, it is worthwhile to use a blended solution, consisting of many predictors. This paper presents an algorithm for constructing a set of CF predictors so that the overall accuracy of the set is high. The algorithm was tested on the Netflix Prize dataset that contains 100 million ratings.","PeriodicalId":106306,"journal":{"name":"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Predictor set optimization for collaborative filtering\",\"authors\":\"Orsolya Horvath, G. Takács\",\"doi\":\"10.1109/IDAACS.2011.6072784\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the most efficient approaches to create a recommender system is collaborative filtering (CF). CF does not require metadata about users and items, but only interactions between users and items (e.g. ratings), therefore it can be applied in many problem domains. Experience shows that for achieving high accuracy, it is worthwhile to use a blended solution, consisting of many predictors. This paper presents an algorithm for constructing a set of CF predictors so that the overall accuracy of the set is high. The algorithm was tested on the Netflix Prize dataset that contains 100 million ratings.\",\"PeriodicalId\":106306,\"journal\":{\"name\":\"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IDAACS.2011.6072784\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDAACS.2011.6072784","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

协同过滤(CF)是创建推荐系统最有效的方法之一。CF不需要关于用户和项目的元数据,而只需要用户和项目之间的交互(例如评级),因此它可以应用于许多问题领域。经验表明,为了获得较高的准确性,值得使用由许多预测器组成的混合解决方案。本文提出了一种构造CF预测集的算法,使预测集的总体精度较高。该算法在包含1亿个收视率的Netflix Prize数据集上进行了测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Predictor set optimization for collaborative filtering
One of the most efficient approaches to create a recommender system is collaborative filtering (CF). CF does not require metadata about users and items, but only interactions between users and items (e.g. ratings), therefore it can be applied in many problem domains. Experience shows that for achieving high accuracy, it is worthwhile to use a blended solution, consisting of many predictors. This paper presents an algorithm for constructing a set of CF predictors so that the overall accuracy of the set is high. The algorithm was tested on the Netflix Prize dataset that contains 100 million ratings.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信