Feature selection SDA method in ensemble nearest neighbor classifier

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The curse of dimensionality is still a big problem in the pattern recognition field. Feature extraction and feature selection have been presented as two general solutions for this problem. In this paper, a new approach based on combination of these methods has been proposed to classify different classes in large dimensional problems. Among the vast variety of search strategies,Tabu Search (TB) is chosen here as a core for feature selection. Filters & Wrappersare the two traditional types of objective functions for feature selection which both applied in this study. Following a feature extraction approach is considered. Subclass Discriminant Analysis (SDA), as a successful strategy in feature extraction has been employed. the result of each objective function on the standard UCI datasets are shown. Finally a revised nearest neighbor classifier has been used to classify the patterns in the new feature space on the UCI data sets and the results show the supremacy of our combinatorial approach in comparison with the traditional methods. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Alimardani, F., Boostani, R., & Ansari, E. (2008). Feature selection SDA method in ensemble nearest neighbor classifier. In Communications in Computer and Information Science (Vol. 6 CCIS, pp. 884–887). https://doi.org/10.1007/978-3-540-89985-3_125

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