641 search results - page 33 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
ICML
1997
IEEE
15 years 1 months ago
1997
IEEE
Feature selection has proven to be a valuable technique in supervised learning for improving predictive accuracy while reducing the number of attributes considered in a task. We i...
82
Voted
TIT
2002
14 years 9 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
80
Voted
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
This paper analyzes the performance of a genetic algorithm that utilizes tournament selection, one-point crossover, and a reordering operator. A model is proposed to describe the c...
NIPS
2008
14 years 11 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
BMCBI
2005
14 years 9 months ago
2005
Background: A new algorithm for assessing similarity between primer and template has been developed based on the hypothesis that annealing of primer to template is an information ...