Çelik, S.Koyuncu, H.2023-03-032023-03-0320229781665475198https://doi.org/10.1109/MAJICC56935.2022.9994150https://hdl.handle.net/20.500.13091/36962022 Mohammad Ali Jinnah University International Conference on Computing, MAJICC 2022 -- 27 October 2022 through 28 October 2022 -- 185726Feature 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. © 2022 IEEE.eninfo:eu-repo/semantics/closedAccessBinarizationChaotic BehaviourFeature SelectionOptimizationPattern ClassificationWrapper MethodClassification (of information)Nearest neighbor searchParticle swarm optimization (PSO)BinarizationsBinary conversionChaotic behaviourChaotic particle swarm optimizationsFeatures selectionGauss mapsOptimisationsOptimization methodPatterns classificationWrapper methodsFeature SelectionConference Object10.1109/MAJICC56935.2022.99941502-s2.0-85146436328