Ahmet Zencirli, Harun Çetin, Nedim Tuğ, Engin Seven, Tolga Ensari
{"title":"Makine Öğrenimi ile Uzun Kuyruk Ürünler için İyileştirilmiş Sonraki Öğe Önerisi","authors":"Ahmet Zencirli, Harun Çetin, Nedim Tuğ, Engin Seven, Tolga Ensari","doi":"10.36287/ijmsit.6.1.97","DOIUrl":null,"url":null,"abstract":"Extended Abstract – Many different types of products can be sold on electronic commerce platforms. Products can be sold regardless of where customers are. The recommendation system on these platforms plays a critical role in selecting and displaying interesting products for users. In the study, the products to be purchased next to the customers were recommended in the most accurate way. For this, machine learning algorithms were used and the results were compared. The singular value decomposition (SVD) method has achieved more successful results. Research Problem/Questions – To make the most appropriate match between an infinite number of products and many customers in the most accurate way. Short Literature Review – Many algorithms have been developed for the best solution in recommendation systems that try to persuade their customers to sell niche products, and it is currently a subject open to research. Methodology and k nearest neighbor (kNN) algorithms are in the long queue in electronic commerce have been improved by developing the next item recommendation system. Results and Conclusions – Machine learning algorithms can be used to solve problems in product recommendation systems. The SVD method suggested less erroneous recommendations for large datasets.","PeriodicalId":166049,"journal":{"name":"International Journal of Multidisciplinary Studies and Innovative Technologies","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Multidisciplinary Studies and Innovative Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36287/ijmsit.6.1.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

许多不同类型的产品可以在电子商务平台上销售。无论顾客在哪里,产品都可以销售出去。这些平台上的推荐系统在为用户选择和展示感兴趣的产品方面起着至关重要的作用。在研究中,顾客旁边购买的产品是最准确的推荐方式。为此,使用了机器学习算法并对结果进行了比较。奇异值分解(SVD)方法取得了较为成功的结果。研究问题/问题-以最准确的方式在无限数量的产品和众多客户之间进行最合适的匹配。简短的文献综述-许多算法已经被开发出来,用于劝说客户销售利基产品的推荐系统的最佳解决方案,目前这是一个开放的研究课题。通过开发下一项推荐系统,改进了电子商务中长队列中的方法和k近邻(kNN)算法。结果和结论——机器学习算法可用于解决产品推荐系统中的问题。对于大型数据集,奇异值分解方法建议的错误较少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Makine Öğrenimi ile Uzun Kuyruk Ürünler için İyileştirilmiş Sonraki Öğe Önerisi
Extended Abstract – Many different types of products can be sold on electronic commerce platforms. Products can be sold regardless of where customers are. The recommendation system on these platforms plays a critical role in selecting and displaying interesting products for users. In the study, the products to be purchased next to the customers were recommended in the most accurate way. For this, machine learning algorithms were used and the results were compared. The singular value decomposition (SVD) method has achieved more successful results. Research Problem/Questions – To make the most appropriate match between an infinite number of products and many customers in the most accurate way. Short Literature Review – Many algorithms have been developed for the best solution in recommendation systems that try to persuade their customers to sell niche products, and it is currently a subject open to research. Methodology and k nearest neighbor (kNN) algorithms are in the long queue in electronic commerce have been improved by developing the next item recommendation system. Results and Conclusions – Machine learning algorithms can be used to solve problems in product recommendation systems. The SVD method suggested less erroneous recommendations for large datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信