使用机器学习模型的基于指针的物品到物品协同过滤推荐系统

C. Iwendi, Ebuka Ibeke, Harshini Eggoni, Sreerajavenkatareddy Velagala, Gautam Srivastava
{"title":"使用机器学习模型的基于指针的物品到物品协同过滤推荐系统","authors":"C. Iwendi, Ebuka Ibeke, Harshini Eggoni, Sreerajavenkatareddy Velagala, Gautam Srivastava","doi":"10.1142/s0219622021500619","DOIUrl":null,"url":null,"abstract":"The creation of digital marketing has enabled companies to adopt personalized item recommendations for their customers. This process keeps them ahead of the competition. One of the techniques used in item recommendation is known as item-based recommendation system or item–item collaborative filtering. Presently, item recommendation is based completely on ratings like 1–5, which is not included in the comment section. In this context, users or customers express their feelings and thoughts about products or services. This paper proposes a machine learning model system where 0, 2, 4 are used to rate products. 0 is negative, 2 is neutral, 4 is positive. This will be in addition to the existing review system that takes care of the users’ reviews and comments, without disrupting it. We have implemented this model by using Keras, Pandas and Sci-kit Learning libraries to run the internal work. The proposed approach improved prediction with [Formula: see text] accuracy for Yelp datasets of businesses across 11 metropolitan areas in four countries, along with a mean absolute error (MAE) of [Formula: see text], precision at [Formula: see text], recall at [Formula: see text] and F1-Score at [Formula: see text]. Our model shows scalability advantage and how organizations can revolutionize their recommender systems to attract possible customers and increase patronage. Also, the proposed similarity algorithm was compared to conventional algorithms to estimate its performance and accuracy in terms of its root mean square error (RMSE), precision and recall. Results of this experiment indicate that the similarity recommendation algorithm performs better than the conventional algorithm and enhances recommendation accuracy.","PeriodicalId":13527,"journal":{"name":"Int. J. Inf. Technol. Decis. Mak.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Pointer-Based Item-to-Item Collaborative Filtering Recommendation System Using a Machine Learning Model\",\"authors\":\"C. Iwendi, Ebuka Ibeke, Harshini Eggoni, Sreerajavenkatareddy Velagala, Gautam Srivastava\",\"doi\":\"10.1142/s0219622021500619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The creation of digital marketing has enabled companies to adopt personalized item recommendations for their customers. This process keeps them ahead of the competition. One of the techniques used in item recommendation is known as item-based recommendation system or item–item collaborative filtering. Presently, item recommendation is based completely on ratings like 1–5, which is not included in the comment section. In this context, users or customers express their feelings and thoughts about products or services. This paper proposes a machine learning model system where 0, 2, 4 are used to rate products. 0 is negative, 2 is neutral, 4 is positive. This will be in addition to the existing review system that takes care of the users’ reviews and comments, without disrupting it. We have implemented this model by using Keras, Pandas and Sci-kit Learning libraries to run the internal work. The proposed approach improved prediction with [Formula: see text] accuracy for Yelp datasets of businesses across 11 metropolitan areas in four countries, along with a mean absolute error (MAE) of [Formula: see text], precision at [Formula: see text], recall at [Formula: see text] and F1-Score at [Formula: see text]. Our model shows scalability advantage and how organizations can revolutionize their recommender systems to attract possible customers and increase patronage. Also, the proposed similarity algorithm was compared to conventional algorithms to estimate its performance and accuracy in terms of its root mean square error (RMSE), precision and recall. Results of this experiment indicate that the similarity recommendation algorithm performs better than the conventional algorithm and enhances recommendation accuracy.\",\"PeriodicalId\":13527,\"journal\":{\"name\":\"Int. J. Inf. Technol. Decis. Mak.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Inf. Technol. Decis. Mak.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219622021500619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Inf. Technol. Decis. Mak.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219622021500619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

数字营销的创建使公司能够为客户提供个性化的商品推荐。这个过程使他们在竞争中处于领先地位。项目推荐中使用的一种技术被称为基于项目的推荐系统或项目-项目协同过滤。目前,商品推荐完全是基于1-5这样的评分,这并不包括在评论区。在这种情况下,用户或顾客表达他们对产品或服务的感受和想法。本文提出了一种机器学习模型系统,其中0,2,4被用来对产品进行评级。0是负的,2是中性的,4是正的。这将是对现有的审查系统的补充,该系统负责处理用户的评论和评论,而不会破坏它。我们通过使用Keras、Pandas和Sci-kit Learning库来运行内部工作来实现这个模型。提出的方法提高了预测的准确性,对四个国家11个大都市区的Yelp数据集进行了[公式:见文]预测,平均绝对误差(MAE)为[公式:见文],精度为[公式:见文],召回率为[公式:见文],F1-Score为[公式:见文]。我们的模型展示了可扩展性优势,以及组织如何彻底改变他们的推荐系统,以吸引潜在客户并增加惠顾。并将所提出的相似度算法与传统算法进行比较,从均方根误差(RMSE)、精密度和召回率三个方面评价其性能和准确性。实验结果表明,相似度推荐算法优于传统推荐算法,提高了推荐精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Pointer-Based Item-to-Item Collaborative Filtering Recommendation System Using a Machine Learning Model
The creation of digital marketing has enabled companies to adopt personalized item recommendations for their customers. This process keeps them ahead of the competition. One of the techniques used in item recommendation is known as item-based recommendation system or item–item collaborative filtering. Presently, item recommendation is based completely on ratings like 1–5, which is not included in the comment section. In this context, users or customers express their feelings and thoughts about products or services. This paper proposes a machine learning model system where 0, 2, 4 are used to rate products. 0 is negative, 2 is neutral, 4 is positive. This will be in addition to the existing review system that takes care of the users’ reviews and comments, without disrupting it. We have implemented this model by using Keras, Pandas and Sci-kit Learning libraries to run the internal work. The proposed approach improved prediction with [Formula: see text] accuracy for Yelp datasets of businesses across 11 metropolitan areas in four countries, along with a mean absolute error (MAE) of [Formula: see text], precision at [Formula: see text], recall at [Formula: see text] and F1-Score at [Formula: see text]. Our model shows scalability advantage and how organizations can revolutionize their recommender systems to attract possible customers and increase patronage. Also, the proposed similarity algorithm was compared to conventional algorithms to estimate its performance and accuracy in terms of its root mean square error (RMSE), precision and recall. Results of this experiment indicate that the similarity recommendation algorithm performs better than the conventional algorithm and enhances recommendation accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信