15485 search results - page 6 / 3097 » Computing Optimal Subsets |
DM
2006
13 years 7 months ago
2006
The simple device of maximization over subsets of events can provide substantial improvement over the Dawson
SSPR
2004
Springer
14 years 25 days 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 ...
PAMI
2010
13 years 5 months ago
2010
—Stability (robustness) of feature selection methods is a topic of recent interest, yet often neglected importance, with direct impact on the reliability of machine learning syst...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
OR
2006
Springer
13 years 7 months ago
2006
Springer