Feature Selection via GM-CPSO and Binary Conversion: Analyses on a Binary-Class Dataset

Şevval Çeli̇k, Hasan Koyuncu
{"title":"Feature Selection via GM-CPSO and Binary Conversion: Analyses on a Binary-Class Dataset","authors":"Şevval Çeli̇k, Hasan Koyuncu","doi":"10.1109/MAJICC56935.2022.9994150","DOIUrl":null,"url":null,"abstract":"Feature selection is oft-used to upgrade the system performance in classification-based applications. For this purpose, wrapper-based methods reserve an important place and are designed with efficient optimization methods so as to observe the highest performance. In this paper, a state-of-the-art optimization method named Gauss map-based chaotic particle swarm optimization (GM-CPSO) is handled. Binary conversion is considered to adapt the GM-CPSO to the feature selection. In classification part of the proposed method, k-nearest neighborhood (k-NN) is operated due to its fast and robust performance on classification-based implementations. In experiments, seven metrics (accuracy, sensitivity, specificity, g-mean, precision, f-measure, AUC) are utilized to objectively evaluate the performances, and 80%/20% training-test split is fulfilled to effectively assign the necessary features. Our wrapper-based method is tested on a balanced dataset that is based on Parkinson's disease (PD). As a result, our method presents promising scores by means of seven metrics, and especially, it improves the classification performance about 14.59% concerning the accuracy and AUC rates in comparison with the k-NN method.","PeriodicalId":205027,"journal":{"name":"2022 Mohammad Ali Jinnah University International Conference on Computing (MAJICC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Mohammad Ali Jinnah University International Conference on Computing (MAJICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MAJICC56935.2022.9994150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Feature selection is oft-used to upgrade the system performance in classification-based applications. For this purpose, wrapper-based methods reserve an important place and are designed with efficient optimization methods so as to observe the highest performance. In this paper, a state-of-the-art optimization method named Gauss map-based chaotic particle swarm optimization (GM-CPSO) is handled. Binary conversion is considered to adapt the GM-CPSO to the feature selection. In classification part of the proposed method, k-nearest neighborhood (k-NN) is operated due to its fast and robust performance on classification-based implementations. In experiments, seven metrics (accuracy, sensitivity, specificity, g-mean, precision, f-measure, AUC) are utilized to objectively evaluate the performances, and 80%/20% training-test split is fulfilled to effectively assign the necessary features. Our wrapper-based method is tested on a balanced dataset that is based on Parkinson's disease (PD). As a result, our method presents promising scores by means of seven metrics, and especially, it improves the classification performance about 14.59% concerning the accuracy and AUC rates in comparison with the k-NN method.
基于GM-CPSO和二值转换的特征选择:基于二值类数据集的分析
在基于分类的应用中,特征选择通常用于提升系统性能。为此,基于包装器的方法占有重要地位,并采用高效的优化方法进行设计,以获得最高的性能。提出了一种基于高斯映射的混沌粒子群优化算法(GM-CPSO)。考虑了二进制转换,使GM-CPSO适应于特征选择。在该方法的分类部分,由于k-最近邻(k-NN)在基于分类的实现中具有快速和鲁棒的性能,因此对其进行了操作。在实验中,采用准确率、灵敏度、特异性、g-mean、精密度、f-measure、AUC 7个指标客观评价性能,并实现80%/20%训练-测试分割,有效分配必要的特征。我们基于包装器的方法在一个基于帕金森病(PD)的平衡数据集上进行了测试。结果表明,我们的方法在7个指标上都取得了很好的成绩,特别是在准确率和AUC率方面,与k-NN方法相比,它的分类性能提高了14.59%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信