arrow
Return

Feature selection via binary simultaneous perturbation stochastic approximation.

delete2016-05-01
delete25
delete
OA
AI
V
Vural Aksakallı *
M
Milad Malekipirbazari
DOI:10.1016/j.patrec.2016.03.002delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Feature selection (FS) has become an indispensable task in dealing with today's highly complex pattern recognition problems with massive number of features. In this study, we propose a new wrapper approach for FS based on binary simultaneous perturbation stochastic approximation (BSPSA). This pseudo-gradient descent stochastic algorithm starts with an initial feature vector and moves toward the optimal feature vector via successive iterations. In each iteration, the current feature vector's individual components are perturbed simultaneously by random offsets from a qualified probability distribution. We present computational experiments on datasets with numbers of features ranging from a few dozens to thousands using three widely-used classifiers as wrappers: nearest neighbor, decision tree, and linear support vector machine. We compare our methodology against the full set of features as well as a binary genetic algorithm and sequential FS methods using cross-validated classification error rate and AUC as the performance criteria. Our results indicate that features selected by BSPSA compare favorably to alternative methods in general and BSPSA can yield superior feature sets for datasets with tens of thousands of features by examining an extremely small fraction of the solution space. We are not aware of any other wrapper FS methods that are computationally feasible with good convergence properties for such large datasets. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Classification
Feature selection
Stochastic approximation
Genetic algorithm
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Pattern Recognition Letters cover
Pattern Recognition Letters
IF:
3.3
Papers:
8.0K
Citations:
1.6W

Organization

I
istanbul sehir university
Scholars:
99
Papers: 113
Citations: 1
Cited Papers

Cited Papers

errShare
errSave
Dimensionality reduction using genetic algorithms
err2000-07-01
err606
PREAI
errRaymer, ML; Punch, WE; Goodman, ED; Kuhn, LA; Jain, AK
errShare
errSave
Feature selection based on rough sets and particle swarm optimization
err2007-03-01
err665
errOAAI
errWang, Xiangyang; Yang, Jie; Teng, Xiaolong; Xia, Weijun; Jensen, Richard
errShare
errSave
Genetic algorithms in feature and instance selection
err2013-02-01
err181
PREAI
errTsai, Chih-Fong; Eberle, William; Chu, Chi-Yuan
errShare
errSave
errShare
errSave
researcher View more