323 search results - page 13 / 65 » New Algorithms for Learning in Presence of Errors |
COLT
2000
Springer
13 years 11 months ago
2000
Springer
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
ICML
1998
IEEE
14 years 8 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
In this paper, we propose a new context-sensitive Bayesian learning algorithm. By modeling the distributions of data locations by a mixture of Gaussians, the new algorithm can uti...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We develop a new error bound for transductive learning algorithms. The slack term in the new bound is a function of a relaxed notion of transductive stability, which meas...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We introduce flexible algorithms that can automatically learn mappings from images to actions by interacting with their environment. They work by introducing an image classifier i...