基于竞争算法的推荐系统

Elnaz Mazandarani, Kaori Yoshida, M. Köppen, Wladimir Bodrow
{"title":"基于竞争算法的推荐系统","authors":"Elnaz Mazandarani, Kaori Yoshida, M. Köppen, Wladimir Bodrow","doi":"10.1109/INCoS.2011.141","DOIUrl":null,"url":null,"abstract":"In this paper, we provide the idea of analyzing the performance of algorithms generating personal recommendation by using competing algorithms for one and the same recommendation request based on same situation and information in a unified framework. The analysis of the recently proposed collaborative filter PAF (Popularity Among Friends) for finding user similarity based on past ratings and evaluation of missing ratings of a user-item-matrix in order to generate recommendations will serve as a base to specify competing algorithm for an experimental recommendation system. We present results of an on-line experiment of the proposed recommendation system which will demonstrate the advantage of directly comparing the rate of user acceptance of competing algorithms and allow a statement about their suitability as base of an easy evaluation of the system. The evaluation gives a conclusion about algorithms to be replaced through new competing methods in order to steadily improve the recommendation system.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Recommendation System Based on Competing Algorithms\",\"authors\":\"Elnaz Mazandarani, Kaori Yoshida, M. Köppen, Wladimir Bodrow\",\"doi\":\"10.1109/INCoS.2011.141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we provide the idea of analyzing the performance of algorithms generating personal recommendation by using competing algorithms for one and the same recommendation request based on same situation and information in a unified framework. The analysis of the recently proposed collaborative filter PAF (Popularity Among Friends) for finding user similarity based on past ratings and evaluation of missing ratings of a user-item-matrix in order to generate recommendations will serve as a base to specify competing algorithm for an experimental recommendation system. We present results of an on-line experiment of the proposed recommendation system which will demonstrate the advantage of directly comparing the rate of user acceptance of competing algorithms and allow a statement about their suitability as base of an easy evaluation of the system. The evaluation gives a conclusion about algorithms to be replaced through new competing methods in order to steadily improve the recommendation system.\",\"PeriodicalId\":235301,\"journal\":{\"name\":\"2011 Third International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Third International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCoS.2011.141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2011.141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在本文中,我们提出了在统一的框架下,基于相同的情况和信息,对同一个推荐请求使用竞争算法来分析生成个人推荐算法的性能。最近提出的协作过滤器PAF (popular Among Friends)基于用户-物品矩阵的过去评级和缺失评级评估来寻找用户相似度,以生成推荐,分析PAF将作为实验推荐系统指定竞争算法的基础。我们展示了所提出的推荐系统的在线实验结果,该实验将证明直接比较竞争算法的用户接受率的优势,并允许对其适用性进行陈述,作为对系统进行简单评估的基础。通过评价,得出了通过新的竞争方法取代推荐算法的结论,以稳步改进推荐系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Recommendation System Based on Competing Algorithms
In this paper, we provide the idea of analyzing the performance of algorithms generating personal recommendation by using competing algorithms for one and the same recommendation request based on same situation and information in a unified framework. The analysis of the recently proposed collaborative filter PAF (Popularity Among Friends) for finding user similarity based on past ratings and evaluation of missing ratings of a user-item-matrix in order to generate recommendations will serve as a base to specify competing algorithm for an experimental recommendation system. We present results of an on-line experiment of the proposed recommendation system which will demonstrate the advantage of directly comparing the rate of user acceptance of competing algorithms and allow a statement about their suitability as base of an easy evaluation of the system. The evaluation gives a conclusion about algorithms to be replaced through new competing methods in order to steadily improve the recommendation system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信