11 search results - page 1 / 3 » Prototype and Feature Selection by Sampling and Random Mutat... |
ICML
1994
IEEE
13 years 7 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
SSPR
2004
Springer
13 years 9 months ago
2004
Springer
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 ...
ICPR
2004
IEEE
14 years 5 months ago
2004
IEEE
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....