By Topic

Optimal and suboptimal feature selection for classification of evoked brain potentials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Halliday, D.L. ; Bendex Guidance Syst. Div., Mishawaka, IN, USA ; McGillem, C.D. ; Westerkamp, J. ; Aunon, Jorge I.

Exhaustive feature selection algorithms are optimal because all possible combinations of features are tested against a predetermined criterion. Suboptimal algorithms that trade performance for speed by considering only a subset of all feature combinations are generally preferred. An implementation of the exhaustive search feature selection (ESFS) method is described for the Bayes Gaussian statistics. The algorithm significantly reduces the computational and time requirements normally associated with optimal algorithms. The performance of this algorithm is compared to that of two suboptimal algorithms-forward sequential features selection and stepwise linear discriminant analysis. Results show that this implementation provides a moderate improvement in classification accuracy and is well suited for evaluating the performance of suboptimal algorithms.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-15 ,  Issue: 3 )