A Novel Data Filtering for a Modified Cuckoo Search Based Movie Recommender

Zahra Haghgu, Seyed Mohammad Hossein Hasheminejad, R. Azmi
{"title":"A Novel Data Filtering for a Modified Cuckoo Search Based Movie Recommender","authors":"Zahra Haghgu, Seyed Mohammad Hossein Hasheminejad, R. Azmi","doi":"10.1109/ICWR51868.2021.9443116","DOIUrl":null,"url":null,"abstract":"Nowadays, recommender systems are inseparable parts of e-commerce businesses and help in personalizing the offers. Clustering is an unsupervised tool to divide a given dataset into clusters based on a similarity metric. Hybrid recommendations based on clustering and metaheuristic optimization can improve predictions significantly. In our approach, the K-means algorithm applies for clustering the data, and the modified cuckoo search algorithm optimizes the clustering by moving some items into better clusters. the modified cuckoo search optimization we have used here replaces the random selection with tournament selection, which results in better clustering and prevents the algorithm from immature convergence. We also tried new filtering on data instead of modifying the clustering algorithm. With this new filtering, we made the recommendations more focused on the most interesting nearest movies. We compared the performance of our method to the existing methods, and the results show a significant improvement.","PeriodicalId":377597,"journal":{"name":"2021 7th International Conference on Web Research (ICWR)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th International Conference on Web Research (ICWR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWR51868.2021.9443116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Nowadays, recommender systems are inseparable parts of e-commerce businesses and help in personalizing the offers. Clustering is an unsupervised tool to divide a given dataset into clusters based on a similarity metric. Hybrid recommendations based on clustering and metaheuristic optimization can improve predictions significantly. In our approach, the K-means algorithm applies for clustering the data, and the modified cuckoo search algorithm optimizes the clustering by moving some items into better clusters. the modified cuckoo search optimization we have used here replaces the random selection with tournament selection, which results in better clustering and prevents the algorithm from immature convergence. We also tried new filtering on data instead of modifying the clustering algorithm. With this new filtering, we made the recommendations more focused on the most interesting nearest movies. We compared the performance of our method to the existing methods, and the results show a significant improvement.
一种基于改进布谷鸟搜索的电影推荐数据过滤方法
如今,推荐系统是电子商务业务不可分割的一部分,有助于个性化的报价。聚类是一种基于相似性度量将给定数据集划分为簇的无监督工具。基于聚类和元启发式优化的混合推荐可以显著提高预测效果。在我们的方法中,K-means算法应用于数据聚类,改进的布谷鸟搜索算法通过将一些项移动到更好的聚类中来优化聚类。我们在这里使用的改进布谷鸟搜索优化用锦标赛选择代替了随机选择,得到了更好的聚类效果,避免了算法的不成熟收敛。我们还尝试对数据进行新的过滤,而不是修改聚类算法。有了这个新的过滤,我们的推荐更专注于最有趣的最近的电影。我们将该方法的性能与现有方法进行了比较,结果显示出明显的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信