3502 search results - page 131 / 701 » From Machine Learning to Machine Reasoning |
123
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper is concerned with the problem of predicting relative performance of classification algorithms. It focusses on methods that use results on small samples and discusses th...
126
click to vote
ICONIP
2007
15 years 6 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
111
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We investigate the empirical applicability of several bounds (a number of which are new) on the true error rate of learned classifiers which hold whenever the examples are chosen ...
116
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
117
click to vote
COLT
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We investigate the generalization behavior of sequential prediction (online) algorithms, when data are generated from a probability distribution. Using some newly develop...