Sciweavers

518 search results - page 6 / 104
» Dynamic Oscillating Search algorithm for feature selection
Sort
View
ICANN
2007
Springer
13 years 11 months ago
An Efficient Search Strategy for Feature Selection Using Chow-Liu Trees
Within the taxonomy of feature extraction methods, recently the Wrapper approaches lost some popularity due to the associated computational burden, compared to Embedded or Filter m...
Erik Schaffernicht, Volker Stephan, Horst-Michael ...
ECML
1998
Springer
13 years 12 months ago
A Monotonic Measure for Optimal Feature Selection
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
Huan Liu, Hiroshi Motoda, Manoranjan Dash
ICTAI
1993
IEEE
13 years 11 months ago
Robust Feature Selection Algorithms
Selecting a set of features which is optimal for a given task is a problem which plays an important role in a wide variety of contexts including pattern recognition, adaptive cont...
Haleh Vafaie, Kenneth DeJong
SSPR
2004
Springer
14 years 29 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 ...
SGAI
2004
Springer
14 years 29 days ago
Overfitting in Wrapper-Based Feature Subset Selection: The Harder You Try the Worse it Gets
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high...
John Loughrey, Padraig Cunningham