Improving Recommender Systems Performances Using User Dimension Expansion by Movies’ Genres and Voting-Based Ensemble Machine Learning Technique

Arash Oshnoudi, Behzad Soleimani Neysiani, Zahra Aminoroaya, N. Nematbakhsh
{"title":"Improving Recommender Systems Performances Using User Dimension Expansion by Movies’ Genres and Voting-Based Ensemble Machine Learning Technique","authors":"Arash Oshnoudi, Behzad Soleimani Neysiani, Zahra Aminoroaya, N. Nematbakhsh","doi":"10.1109/ICWR51868.2021.9443146","DOIUrl":null,"url":null,"abstract":"The recommender system's performance needs to be improved more than ever by increasing computer systems' usage in various applications. Recommender systems are a valuable tool in e-commerce websites. Their primary purpose is to generate accurate forecasts to access information in less time and energy for end-users. Classification optimizes information retrieval activity in these systems and reduces user search time. Besides, clustering tries to insert the new object in the best similar class, like using the k-nearest neighbor algorithm as a classifier. The proposing approach focuses on modeling categories by averaging rates of movie genres.Moreover, the user clustering will be improved by voting machine learning classifiers on multilayer perceptron (MLP) neural networks and k-nearest neighbors (kNN) algorithms. The experiments performed on the MovieLens dataset show that the proposed method is more successful than other previous methods in predicting user clusters with 93.81% accuracy, 94.45% precision, and 92.81% recall. Also, Davies Bouldin metrics indicates better clustering result using dimension expansion of movies' genres.","PeriodicalId":377597,"journal":{"name":"2021 7th International Conference on Web Research (ICWR)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","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.9443146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The recommender system's performance needs to be improved more than ever by increasing computer systems' usage in various applications. Recommender systems are a valuable tool in e-commerce websites. Their primary purpose is to generate accurate forecasts to access information in less time and energy for end-users. Classification optimizes information retrieval activity in these systems and reduces user search time. Besides, clustering tries to insert the new object in the best similar class, like using the k-nearest neighbor algorithm as a classifier. The proposing approach focuses on modeling categories by averaging rates of movie genres.Moreover, the user clustering will be improved by voting machine learning classifiers on multilayer perceptron (MLP) neural networks and k-nearest neighbors (kNN) algorithms. The experiments performed on the MovieLens dataset show that the proposed method is more successful than other previous methods in predicting user clusters with 93.81% accuracy, 94.45% precision, and 92.81% recall. Also, Davies Bouldin metrics indicates better clustering result using dimension expansion of movies' genres.
基于电影类型和基于投票的集成机器学习技术的用户维度扩展改进推荐系统的性能
随着计算机系统在各种应用中的使用量的增加,推荐系统的性能比以往任何时候都需要得到提高。推荐系统是电子商务网站中一个很有价值的工具。它们的主要目的是生成准确的预测,以便最终用户在更短的时间和精力内访问信息。分类优化了这些系统中的信息检索活动,减少了用户搜索时间。此外,聚类尝试将新对象插入到最佳相似类中,例如使用k近邻算法作为分类器。提出的方法侧重于通过平均电影类型的比率来建模类别。此外,将通过多层感知器(MLP)神经网络和k近邻(kNN)算法上的投票机器学习分类器来改进用户聚类。在MovieLens数据集上进行的实验表明,该方法在预测用户簇方面比其他方法更成功,准确率为93.81%,精密度为94.45%,召回率为92.81%。此外,Davies Bouldin指标表明,对电影类型进行维度扩展的聚类效果更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信