分类算法分析:来自 MNIST 和 WDBC 数据集的启示

Jiyue Zhao, Tony Yuxiang Pan, Weibo Yao, Hongwei Lu, Zihan Liu
{"title":"分类算法分析:来自 MNIST 和 WDBC 数据集的启示","authors":"Jiyue Zhao, Tony Yuxiang Pan, Weibo Yao, Hongwei Lu, Zihan Liu","doi":"10.54254/2755-2721/79/20241622","DOIUrl":null,"url":null,"abstract":"Various classification algorithms applied to sophisticated datasets have seen significant development over the years, which involves dealing with the growing complexities of real-world data and providing efficient solutions for numerous domains like healthcare and data analysis. There is a critical need to identify the most effective algorithms to deliver high precision and generalizability. This study intends to assess diverse models, including Support Vector Machine (SVM), Multi-Layer Perceptron (MLP), DTs (DT), and Random Forests (RF), on Modified National Institute of Standards and Technology (MNIST) and Wisconsin Diagnostic Breast Cancer (WDBC) datasets, utilizing metrics like Overall Accuracy (OA), Average Accuracy (AA), and Cohens kappa. The study has shown that the performance of the algorithms is mainly determined by the dataset's features. Additionally, insights into the strengths and limitations of each model are provided.","PeriodicalId":502253,"journal":{"name":"Applied and Computational Engineering","volume":"37 12","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of classification algorithms: Insights from MNIST and WDBC datasets\",\"authors\":\"Jiyue Zhao, Tony Yuxiang Pan, Weibo Yao, Hongwei Lu, Zihan Liu\",\"doi\":\"10.54254/2755-2721/79/20241622\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Various classification algorithms applied to sophisticated datasets have seen significant development over the years, which involves dealing with the growing complexities of real-world data and providing efficient solutions for numerous domains like healthcare and data analysis. There is a critical need to identify the most effective algorithms to deliver high precision and generalizability. This study intends to assess diverse models, including Support Vector Machine (SVM), Multi-Layer Perceptron (MLP), DTs (DT), and Random Forests (RF), on Modified National Institute of Standards and Technology (MNIST) and Wisconsin Diagnostic Breast Cancer (WDBC) datasets, utilizing metrics like Overall Accuracy (OA), Average Accuracy (AA), and Cohens kappa. The study has shown that the performance of the algorithms is mainly determined by the dataset's features. Additionally, insights into the strengths and limitations of each model are provided.\",\"PeriodicalId\":502253,\"journal\":{\"name\":\"Applied and Computational Engineering\",\"volume\":\"37 12\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied and Computational Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.54254/2755-2721/79/20241622\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied and Computational Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54254/2755-2721/79/20241622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多年来,应用于复杂数据集的各种分类算法有了长足的发展,其中包括处理现实世界中日益复杂的数据,以及为医疗保健和数据分析等众多领域提供高效的解决方案。目前亟需确定最有效的算法,以提供高精度和可推广性。本研究旨在利用总体准确率(OA)、平均准确率(AA)和科恩斯卡帕(Cohens kappa)等指标,在美国国家标准与技术研究院(MNIST)和威斯康星州乳腺癌诊断(WDBC)数据集上评估各种模型,包括支持向量机(SVM)、多层感知器(MLP)、DTs(DT)和随机森林(RF)。研究表明,算法的性能主要取决于数据集的特征。此外,研究还深入分析了每种模型的优势和局限性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of classification algorithms: Insights from MNIST and WDBC datasets
Various classification algorithms applied to sophisticated datasets have seen significant development over the years, which involves dealing with the growing complexities of real-world data and providing efficient solutions for numerous domains like healthcare and data analysis. There is a critical need to identify the most effective algorithms to deliver high precision and generalizability. This study intends to assess diverse models, including Support Vector Machine (SVM), Multi-Layer Perceptron (MLP), DTs (DT), and Random Forests (RF), on Modified National Institute of Standards and Technology (MNIST) and Wisconsin Diagnostic Breast Cancer (WDBC) datasets, utilizing metrics like Overall Accuracy (OA), Average Accuracy (AA), and Cohens kappa. The study has shown that the performance of the algorithms is mainly determined by the dataset's features. Additionally, insights into the strengths and limitations of each model are provided.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信