为有限大小的数据集识别合适分类器的系统方法

Alanoud Bin Dris, Najla Alzakari, H. Kurdi
{"title":"为有限大小的数据集识别合适分类器的系统方法","authors":"Alanoud Bin Dris, Najla Alzakari, H. Kurdi","doi":"10.1109/ISNCC.2019.8909099","DOIUrl":null,"url":null,"abstract":"Data size is a main issue in any data mining application, since limited size data results in a small training set that leads to a poor classification model and therefore a poor classification performance. Although, many real-life applications need a classifier that deals with limited size data sets appropriately. A considerable interest is focused on how to achieve a reasonable classification performance for small data sets. Current works focus on either enhancing classification algorithms or enlarging the data sets, these solutions have limitations such as increasing the computational time, or reaching data sets that do not reflect the actual population of the real data. However, this research looks at the problem from a different angel, it aims to address the data quantity issue by identifying the most appropriate classifier for small data sets using three well-known classifiers which are Decision tree (J48), Support Vector Machine (SVM) and Naïve Bayes. Extensive experiments are conducted to examine the performance in terms of four different measures which are accuracy, f-measure, sensitivity and specificity. We used six small data sets from UCI repository with different attributes and instances sizes. Results revealed that SVM accomplished the best performance along most of the used data sets.","PeriodicalId":187178,"journal":{"name":"2019 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Systematic Approach to Identify an Appropriate Classifier for Limited-Sized Data Sets\",\"authors\":\"Alanoud Bin Dris, Najla Alzakari, H. Kurdi\",\"doi\":\"10.1109/ISNCC.2019.8909099\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data size is a main issue in any data mining application, since limited size data results in a small training set that leads to a poor classification model and therefore a poor classification performance. Although, many real-life applications need a classifier that deals with limited size data sets appropriately. A considerable interest is focused on how to achieve a reasonable classification performance for small data sets. Current works focus on either enhancing classification algorithms or enlarging the data sets, these solutions have limitations such as increasing the computational time, or reaching data sets that do not reflect the actual population of the real data. However, this research looks at the problem from a different angel, it aims to address the data quantity issue by identifying the most appropriate classifier for small data sets using three well-known classifiers which are Decision tree (J48), Support Vector Machine (SVM) and Naïve Bayes. Extensive experiments are conducted to examine the performance in terms of four different measures which are accuracy, f-measure, sensitivity and specificity. We used six small data sets from UCI repository with different attributes and instances sizes. Results revealed that SVM accomplished the best performance along most of the used data sets.\",\"PeriodicalId\":187178,\"journal\":{\"name\":\"2019 International Symposium on Networks, Computers and Communications (ISNCC)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Symposium on Networks, Computers and Communications (ISNCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISNCC.2019.8909099\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Symposium on Networks, Computers and Communications (ISNCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISNCC.2019.8909099","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

数据大小是任何数据挖掘应用程序中的一个主要问题,因为数据大小有限会导致训练集较小,从而导致分类模型较差,从而导致分类性能较差。尽管,许多现实生活中的应用程序需要一个分类器来适当地处理有限大小的数据集。一个相当大的兴趣集中在如何实现小数据集的合理分类性能。目前的工作集中在增强分类算法或扩大数据集上,这些解决方案有局限性,比如增加计算时间,或者到达的数据集不能反映真实数据的实际人口。然而,本研究从不同的角度看待这个问题,它旨在通过使用决策树(J48)、支持向量机(SVM)和Naïve贝叶斯这三种著名的分类器,为小数据集识别最合适的分类器,来解决数据量问题。进行了广泛的实验,以检查性能方面的四个不同的措施,即准确性,f-测度,敏感性和特异性。我们使用了来自UCI存储库的6个小数据集,它们具有不同的属性和实例大小。结果表明,支持向量机在大多数使用的数据集上都取得了最好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Systematic Approach to Identify an Appropriate Classifier for Limited-Sized Data Sets
Data size is a main issue in any data mining application, since limited size data results in a small training set that leads to a poor classification model and therefore a poor classification performance. Although, many real-life applications need a classifier that deals with limited size data sets appropriately. A considerable interest is focused on how to achieve a reasonable classification performance for small data sets. Current works focus on either enhancing classification algorithms or enlarging the data sets, these solutions have limitations such as increasing the computational time, or reaching data sets that do not reflect the actual population of the real data. However, this research looks at the problem from a different angel, it aims to address the data quantity issue by identifying the most appropriate classifier for small data sets using three well-known classifiers which are Decision tree (J48), Support Vector Machine (SVM) and Naïve Bayes. Extensive experiments are conducted to examine the performance in terms of four different measures which are accuracy, f-measure, sensitivity and specificity. We used six small data sets from UCI repository with different attributes and instances sizes. Results revealed that SVM accomplished the best performance along most of the used data sets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信