Benchmarking Explicit Rating Prediction Algorithms for Cosmetic Products

Raditya Nurfadillah, Fariz Darari, Radityo Eko Prasojo, Yasmin Amalia
{"title":"Benchmarking Explicit Rating Prediction Algorithms for Cosmetic Products","authors":"Raditya Nurfadillah, Fariz Darari, Radityo Eko Prasojo, Yasmin Amalia","doi":"10.1109/isriti51436.2020.9315512","DOIUrl":null,"url":null,"abstract":"Recommendation systems have become a staple feature for any e-commerce sites. The ability to predict whether a customer likes an unseen product forms the very foundation of a recommendation system. In this paper, we concern the issue of explicit rating prediction over cosmetic products. Given a dataset of cosmetic product ratings, we analyze the characteristics of the dataset and implement a wide range of algorithms, such as KNN and matrix factorization, to predict such ratings. We evaluate the performance of these algorithms using MAE and RMSE measures, and discuss factors that may contribute to their performance results. Our experiments have shown that the SVD++ technique performs the best among all with an MAE of 0.7699 and an RMSE of 0.9696. We hope that our paper can shed new light on the selection of explicit rating prediction algorithms not only in the domain of beauty products, but also in wider scenarios.","PeriodicalId":325920,"journal":{"name":"2020 3rd International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 3rd International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/isriti51436.2020.9315512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Recommendation systems have become a staple feature for any e-commerce sites. The ability to predict whether a customer likes an unseen product forms the very foundation of a recommendation system. In this paper, we concern the issue of explicit rating prediction over cosmetic products. Given a dataset of cosmetic product ratings, we analyze the characteristics of the dataset and implement a wide range of algorithms, such as KNN and matrix factorization, to predict such ratings. We evaluate the performance of these algorithms using MAE and RMSE measures, and discuss factors that may contribute to their performance results. Our experiments have shown that the SVD++ technique performs the best among all with an MAE of 0.7699 and an RMSE of 0.9696. We hope that our paper can shed new light on the selection of explicit rating prediction algorithms not only in the domain of beauty products, but also in wider scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
化妆品显式评级预测算法的基准测试
推荐系统已经成为任何电子商务网站的主要功能。预测顾客是否喜欢未见过的产品的能力构成了推荐系统的基础。在本文中,我们关注化妆品的显式评级预测问题。给定化妆品评级数据集,我们分析数据集的特征,并实现广泛的算法,如KNN和矩阵分解,来预测这些评级。我们使用MAE和RMSE度量来评估这些算法的性能,并讨论可能影响其性能结果的因素。我们的实验表明,svd++技术在所有技术中表现最好,MAE为0.7699,RMSE为0.9696。我们希望我们的论文能够为明确评级预测算法的选择提供新的思路,不仅在美容产品领域,而且在更广泛的场景中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Combined Firefly Algorithm-Random Forest to Classify Autistic Spectrum Disorders Analysis of Indonesia's Internet Topology Borders at the Autonomous System Level Influence Distribution Training Data on Performance Supervised Machine Learning Algorithms Design of Optimal Satellite Constellation for Indonesian Regional Navigation System based on GEO and GSO Satellites Real-time Testing on Improved Data Transmission Security in the Industrial Control System
×
引用
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