A Multi-Population Based Evolutionary Algorithm for Many-Objective Recommendations

IF 5.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Emerging Topics in Computational Intelligence Pub Date : 2024-02-13 DOI:10.1109/TETCI.2024.3359093
Lei Zhang;Huabin Zhang;Zihao Chen;Sibo Liu;Haipeng Yang;Hongke Zhao
{"title":"A Multi-Population Based Evolutionary Algorithm for Many-Objective Recommendations","authors":"Lei Zhang;Huabin Zhang;Zihao Chen;Sibo Liu;Haipeng Yang;Hongke Zhao","doi":"10.1109/TETCI.2024.3359093","DOIUrl":null,"url":null,"abstract":"Multi-objective evolutionary algorithms (MOEAs) have been proved to be competitive in recommender systems. As the application scenarios of recommender systems become increasingly complex, the number of objectives to be considered in the recommender systems increases. However, most existing multi-objective recommendation algorithms lead to increased environmental selection pressure as the number of objectives increases. To tackle the issue, in this paper, we propose a multi-population based evolutionary algorithm named MP-MORS for many-objective recommendations, where two subpopulations and one major population are used to evolve and interact to find high-quality solutions. Specifically, the objectives are firstly divided into those evaluated on individual users (defined as IndObjectives) and those evaluated on all users (defined as as AllObjectives). Then two subpopulations are suggested to optimize the two types of objectives respectively, with which the potential good solutions can be easily found. In addition, the major population considers the balance of all objectives and refines these potential good solutions. Finally, a set of high-quality solutions can be obtained by the proposed adaptive population interaction strategy. Experiments on the datasets \n<italic>Movielens</i>\n and \n<italic>Douban</i>\n show that the proposed MP-MORS outperforms the state-of-the-art algorithms for many-objective recommendations.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":5.3000,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10433864/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Multi-objective evolutionary algorithms (MOEAs) have been proved to be competitive in recommender systems. As the application scenarios of recommender systems become increasingly complex, the number of objectives to be considered in the recommender systems increases. However, most existing multi-objective recommendation algorithms lead to increased environmental selection pressure as the number of objectives increases. To tackle the issue, in this paper, we propose a multi-population based evolutionary algorithm named MP-MORS for many-objective recommendations, where two subpopulations and one major population are used to evolve and interact to find high-quality solutions. Specifically, the objectives are firstly divided into those evaluated on individual users (defined as IndObjectives) and those evaluated on all users (defined as as AllObjectives). Then two subpopulations are suggested to optimize the two types of objectives respectively, with which the potential good solutions can be easily found. In addition, the major population considers the balance of all objectives and refines these potential good solutions. Finally, a set of high-quality solutions can be obtained by the proposed adaptive population interaction strategy. Experiments on the datasets Movielens and Douban show that the proposed MP-MORS outperforms the state-of-the-art algorithms for many-objective recommendations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于多群体的多目标推荐进化算法
多目标进化算法(MOEAs)已被证明在推荐系统中具有竞争力。随着推荐系统的应用场景变得越来越复杂,推荐系统中需要考虑的目标数量也随之增加。然而,大多数现有的多目标推荐算法都会随着目标数量的增加而导致环境选择压力增大。为了解决这个问题,本文提出了一种基于多种群的进化算法,名为 MP-MORS,用于多目标推荐,其中使用两个子种群和一个主种群进行进化和交互,以找到高质量的解决方案。具体来说,首先将目标分为对单个用户进行评估的目标(定义为 IndObjectives)和对所有用户进行评估的目标(定义为 AllObjectives)。然后建议两个子群分别对这两类目标进行优化,这样就能很容易地找到潜在的好解决方案。此外,主群还会考虑所有目标的平衡,并完善这些潜在的优秀解决方案。最后,通过所提出的自适应种群交互策略,可以获得一组高质量的解决方案。在 Movielens 和豆瓣数据集上的实验表明,所提出的 MP-MORS 优于最先进的多目标推荐算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
10.30
自引率
7.50%
发文量
147
期刊介绍: The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys. TETCI is an electronics only publication. TETCI publishes six issues per year. Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.
期刊最新文献
Table of Contents IEEE Computational Intelligence Society Information IEEE Transactions on Emerging Topics in Computational Intelligence Information for Authors IEEE Transactions on Emerging Topics in Computational Intelligence Publication Information A Novel Multi-Source Information Fusion Method Based on Dependency Interval
×
引用
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