Sciweavers

936 search results - page 6 / 188
» Experimental Comparison of Feature Subset Selection Methods
Sort
View
IJCNN
2008
IEEE
14 years 1 months ago
Sparse kernel density estimator using orthogonal regression based on D-Optimality experimental design
— A novel sparse kernel density estimator is derived based on a regression approach, which selects a very small subset of significant kernels by means of the D-optimality experi...
Sheng Chen, Xia Hong, Chris J. Harris
GECCO
2004
Springer
144views Optimization» more  GECCO 2004»
14 years 25 days ago
Feature Subset Selection, Class Separability, and Genetic Algorithms
Abstract. The performance of classification algorithms in machine learning is affected by the features used to describe the labeled examples presented to the inducers. Therefore,...
Erick Cantú-Paz
SAC
2006
ACM
14 years 1 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
ICGA
1997
133views Optimization» more  ICGA 1997»
13 years 8 months ago
Messy Genetic Algorithms for Subset Feature Selection
Subset Feature Selection problems can have severalattributes which may make Messy Genetic Algorithms an appropriateoptimization method. First, competitive solutions may often use ...
L. Darrell Whitley, J. Ross Beveridge, Cesar Guerr...
SSPR
2004
Springer
14 years 23 days ago
Feature Subset Selection Using an Optimized Hill Climbing Algorithm for Handwritten Character Recognition
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
Carlos M. Nunes, Alceu de Souza Britto Jr., Celso ...