Sciweavers

1405 search results - page 9 / 281
» Anytime Algorithm for Feature Selection
Sort
View
ICGA
1997
133views Optimization» more  ICGA 1997»
15 years 3 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...
135
Voted
NIPS
2003
15 years 3 months ago
Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
Claudio Gentile
126
Voted
GECCO
2004
Springer
144views Optimization» more  GECCO 2004»
15 years 7 months 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
130
Voted
EWCBR
2006
Springer
15 years 5 months ago
Rough Set Feature Selection Algorithms for Textual Case-Based Classification
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
Kalyan Moy Gupta, David W. Aha, Philip Moore
ICML
2004
IEEE
16 years 2 months ago
Margin based feature selection - theory and algorithms
Feature selection is the task of choosing a small set out of a given set of features that capture the relevant properties of the data. In the context of supervised classification ...
Ran Gilad-Bachrach, Amir Navot, Naftali Tishby