An Ensemble-based Machine Learning Model for Accurate Predictions using Multiple Categorical Datasets

Rajni Bhalla, Amit Sharma, Amandeep, J. Gupta
{"title":"An Ensemble-based Machine Learning Model for Accurate Predictions using Multiple Categorical Datasets","authors":"Rajni Bhalla, Amit Sharma, Amandeep, J. Gupta","doi":"10.1109/ICPS55917.2022.00008","DOIUrl":null,"url":null,"abstract":"In the consumer sector, electronic reviews are more common and comprehensive. Manufacturers, retailers, and customers are all aware of it. All require this knowledge to benefit from considering and guiding the massive and energetic data spaces that follow. Many social media outlets give polarized feedback. A fundamental problem with the internet's destructive content is that it makes it impossible for people to read important information. We'll look at all of the traditional machine learning approaches to catch the true sentiment. The accuracy using decision tree, naïve bayes and KNN applied on nursery dataset. All these three techniques achieved precisons of 72 to 90%. Decision tree performed well and accurate result as compared to knn and naïve bayes.The decision tree faced overfitting issues and KNN faced issues in deciding the value of K. On a large dataset, complexity increase when we apply a decision tree. Zero probability issues are a major challenge in naïve Bayes. To solve all those issues, an ensemble machine learning model (NKD) for accurate predictions is proposed to check the performance of the model. The proposed methodology applied on nursery dataset and IRIS dataset. The accuracy achieved using iris dataset is 100%.","PeriodicalId":263404,"journal":{"name":"2022 Second International Conference on Interdisciplinary Cyber Physical Systems (ICPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Second International Conference on Interdisciplinary Cyber Physical Systems (ICPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPS55917.2022.00008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the consumer sector, electronic reviews are more common and comprehensive. Manufacturers, retailers, and customers are all aware of it. All require this knowledge to benefit from considering and guiding the massive and energetic data spaces that follow. Many social media outlets give polarized feedback. A fundamental problem with the internet's destructive content is that it makes it impossible for people to read important information. We'll look at all of the traditional machine learning approaches to catch the true sentiment. The accuracy using decision tree, naïve bayes and KNN applied on nursery dataset. All these three techniques achieved precisons of 72 to 90%. Decision tree performed well and accurate result as compared to knn and naïve bayes.The decision tree faced overfitting issues and KNN faced issues in deciding the value of K. On a large dataset, complexity increase when we apply a decision tree. Zero probability issues are a major challenge in naïve Bayes. To solve all those issues, an ensemble machine learning model (NKD) for accurate predictions is proposed to check the performance of the model. The proposed methodology applied on nursery dataset and IRIS dataset. The accuracy achieved using iris dataset is 100%.
基于集成的机器学习模型,用于使用多个分类数据集进行准确预测
在消费领域,电子评论更为普遍和全面。制造商、零售商和客户都意识到了这一点。所有这些都需要这些知识,以便从考虑和指导随之而来的大量和充满活力的数据空间中受益。许多社交媒体给出了两极分化的反馈。互联网破坏性内容的一个根本问题是,它使人们无法阅读重要信息。我们将研究所有传统的机器学习方法来捕捉真实的情绪。利用决策树、naïve贝叶斯和KNN对托儿所数据集进行精度分析。三种方法的精密度均达到72 ~ 90%。与已知贝叶斯和naïve贝叶斯相比,决策树的结果更准确。决策树面临过拟合问题,KNN在确定k值时面临问题。在大型数据集上,应用决策树会增加复杂性。零概率问题是naïve贝叶斯的主要挑战。为了解决这些问题,提出了一种用于准确预测的集成机器学习模型(NKD)来检查模型的性能。该方法应用于托儿所数据集和IRIS数据集。使用虹膜数据集实现的准确率为100%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信