Dimensionality reduction using GA-PSO

15Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

The feature selection process can be considered a problem of global combinatorial optimization in machine learning, which reduces the number of features, removes irrelevant, noisy and redundant data, and results in acceptable classification accuracy. In this paper, we propose a combination of genetic algorithms (GAs) and particle swarm optimization (PSO) for feature selection. The K-nearest neighbor (K-NN) method with leave-one-out cross-validation (LOOCV) serves as an evaluator for the GAs and the PSO. The proposed method is applied to five classification problems taken from the literature. Experimental results show that our method simplifies features effectively and obtains a higher classification accuracy compared to other feature selection methods.

Cite

CITATION STYLE

APA

Yang, C. H., Tu, C. J., Chang, J. Y., Liu, H. H., & Ko, P. C. (2006). Dimensionality reduction using GA-PSO. In Proceedings of the 9th Joint Conference on Information Sciences, JCIS 2006 (Vol. 2006). https://doi.org/10.2991/jcis.2006.130

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free