推荐系统的多目标进化等级聚合

Samuel E. L. Oliveira, Victor Diniz, A. Lacerda, G. Pappa
{"title":"推荐系统的多目标进化等级聚合","authors":"Samuel E. L. Oliveira, Victor Diniz, A. Lacerda, G. Pappa","doi":"10.1109/CEC.2018.8477669","DOIUrl":null,"url":null,"abstract":"Recommender systems help users to overcome the information overload problem by selecting relevant items according to their preferences. This paper deals with the problem of rank aggregation in recommender systems, where we want to generate a single consensus ranking from a given set of input rankings generated by different recommendation algorithms. This problem is NP-hard, and hence the use of meta-heuristics to solve it is appealing. Although accurate suggestions are mandatory for effective recommender systems, other recommendation quality measures need to be taken into account for delivering high-quality suggestions. This paper proposes Multi-objective Evolutionary Rank Aggregation (MERA), a genetic programming algorithm following the concepts of SPEA2 that considers three measures when suggesting items to users, namely mean average precision, diversity, and novelty. The method was tested in 3 realworld recommendation datasets, and the results show MERA can indeed find a balance for these metrics while generating a diverse set of solutions to the problem. MERA was able to return solutions with improvements of up to 15% in diversity (for the Movielens 1M dataset) and 7% in novelty (for the Filmtrust dataset) while maintaining, or even improving, the values of precision.","PeriodicalId":212677,"journal":{"name":"2018 IEEE Congress on Evolutionary Computation (CEC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Multi-objective Evolutionary Rank Aggregation for Recommender Systems\",\"authors\":\"Samuel E. L. Oliveira, Victor Diniz, A. Lacerda, G. Pappa\",\"doi\":\"10.1109/CEC.2018.8477669\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recommender systems help users to overcome the information overload problem by selecting relevant items according to their preferences. This paper deals with the problem of rank aggregation in recommender systems, where we want to generate a single consensus ranking from a given set of input rankings generated by different recommendation algorithms. This problem is NP-hard, and hence the use of meta-heuristics to solve it is appealing. Although accurate suggestions are mandatory for effective recommender systems, other recommendation quality measures need to be taken into account for delivering high-quality suggestions. This paper proposes Multi-objective Evolutionary Rank Aggregation (MERA), a genetic programming algorithm following the concepts of SPEA2 that considers three measures when suggesting items to users, namely mean average precision, diversity, and novelty. The method was tested in 3 realworld recommendation datasets, and the results show MERA can indeed find a balance for these metrics while generating a diverse set of solutions to the problem. MERA was able to return solutions with improvements of up to 15% in diversity (for the Movielens 1M dataset) and 7% in novelty (for the Filmtrust dataset) while maintaining, or even improving, the values of precision.\",\"PeriodicalId\":212677,\"journal\":{\"name\":\"2018 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2018.8477669\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2018.8477669","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

推荐系统通过根据用户的喜好选择相关的项目,帮助用户克服信息过载的问题。本文研究推荐系统中的排名聚合问题,我们希望从不同推荐算法生成的一组给定的输入排名中生成一个单一的共识排名。这个问题是np困难的,因此使用元启发式来解决它很有吸引力。虽然准确的建议对于有效的推荐系统来说是必不可少的,但是为了提供高质量的建议,还需要考虑其他的推荐质量措施。本文提出了多目标进化等级聚合(MERA)算法,这是一种遵循SPEA2概念的遗传规划算法,在向用户推荐项目时考虑三个指标,即平均精度、多样性和新颖性。该方法在3个真实世界的推荐数据集中进行了测试,结果表明MERA确实可以在生成不同的问题解决方案集的同时找到这些指标的平衡。MERA能够返回的解决方案在保持甚至提高精度的同时,多样性提高了15%(对于Movielens 1M数据集),新颖性提高了7%(对于Filmtrust数据集)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multi-objective Evolutionary Rank Aggregation for Recommender Systems
Recommender systems help users to overcome the information overload problem by selecting relevant items according to their preferences. This paper deals with the problem of rank aggregation in recommender systems, where we want to generate a single consensus ranking from a given set of input rankings generated by different recommendation algorithms. This problem is NP-hard, and hence the use of meta-heuristics to solve it is appealing. Although accurate suggestions are mandatory for effective recommender systems, other recommendation quality measures need to be taken into account for delivering high-quality suggestions. This paper proposes Multi-objective Evolutionary Rank Aggregation (MERA), a genetic programming algorithm following the concepts of SPEA2 that considers three measures when suggesting items to users, namely mean average precision, diversity, and novelty. The method was tested in 3 realworld recommendation datasets, and the results show MERA can indeed find a balance for these metrics while generating a diverse set of solutions to the problem. MERA was able to return solutions with improvements of up to 15% in diversity (for the Movielens 1M dataset) and 7% in novelty (for the Filmtrust dataset) while maintaining, or even improving, the values of precision.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic Evolution of AutoEncoders for Compressed Representations Landscape-Based Differential Evolution for Constrained Optimization Problems A Novel Approach for Optimizing Ensemble Components in Rainfall Prediction A Many-Objective Evolutionary Algorithm with Fast Clustering and Reference Point Redistribution Manyobjective Optimization to Design Physical Topology of Optical Networks with Undefined Node Locations
×
引用
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