A hybrid friend-based recommendation system using the combination of Meta-heuristic Invasive weed and genetic algorithms

A. Rezaee, Navid Abravan
{"title":"A hybrid friend-based recommendation system using the combination of Meta-heuristic Invasive weed and genetic algorithms","authors":"A. Rezaee, Navid Abravan","doi":"10.1109/ICCKE50421.2020.9303619","DOIUrl":null,"url":null,"abstract":"One of the most important goals of researchers in designing recommender systems is to increase the accuracy of recommender models. The main purpose of this study is to combine weed algorithm and genetics to increase the efficiency of clustering, which increases the accuracy of clustering for analyzing suggestions in the recommender system. Clustering is based on three similarity criteria KMEAN, JACCARD and MINKOWSKI and in addition, it has been implemented with the mentioned algorithms. Using clustering method considering the mutation of genetic algorithm and using weed algorithm has led to the emergence of an efficient system that for this purpose, genetic generators have been used to sample data in the problem space instead of random generators, This selection has led to an increase in the accuracy of the algorithm due to the more uniform coverage of the problem space and the increase in the variety of problem searches. The Recommender system on the standard MovieLense data set is tested and its error is 0.02, which has a more minimal error than other algorithms (genetics and weeds).","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE50421.2020.9303619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

One of the most important goals of researchers in designing recommender systems is to increase the accuracy of recommender models. The main purpose of this study is to combine weed algorithm and genetics to increase the efficiency of clustering, which increases the accuracy of clustering for analyzing suggestions in the recommender system. Clustering is based on three similarity criteria KMEAN, JACCARD and MINKOWSKI and in addition, it has been implemented with the mentioned algorithms. Using clustering method considering the mutation of genetic algorithm and using weed algorithm has led to the emergence of an efficient system that for this purpose, genetic generators have been used to sample data in the problem space instead of random generators, This selection has led to an increase in the accuracy of the algorithm due to the more uniform coverage of the problem space and the increase in the variety of problem searches. The Recommender system on the standard MovieLense data set is tested and its error is 0.02, which has a more minimal error than other algorithms (genetics and weeds).
一种结合元启发式入侵杂草和遗传算法的基于朋友的混合推荐系统
研究人员在设计推荐系统时最重要的目标之一是提高推荐模型的准确性。本研究的主要目的是将weed算法与遗传学相结合,提高聚类的效率,从而提高推荐系统中对建议进行分析的聚类准确率。聚类基于KMEAN、JACCARD和MINKOWSKI三个相似度标准,并使用上述算法实现。利用考虑遗传算法突变的聚类方法和weed算法,导致了一个高效系统的出现,为此,使用遗传生成器来对问题空间中的数据进行采样,而不是随机生成器,这种选择由于问题空间的覆盖更加均匀,问题搜索的种类增加,从而提高了算法的准确性。在标准MovieLense数据集上对推荐系统进行了测试,其误差为0.02,比其他算法(遗传和杂草)的误差要小得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信