Sciweavers

187 search results - page 14 / 38
» Bounding the cost of learned rules
Sort
View
ICML
1999
IEEE
14 years 9 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason

Publication
173views
12 years 7 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...
ML
1998
ACM
102views Machine Learning» more  ML 1998»
13 years 8 months ago
Statistical Mechanics of Online Learning of Drifting Concepts: A Variational Approach
We review the application of statistical mechanics methods to the study of online learning of a drifting concept in the limit of large systems. The model where a feed-forward netwo...
Renato Vicente, Osame Kinouchi, Nestor Caticha
AAAI
2010
13 years 9 months ago
A Restriction of Extended Resolution for Clause Learning SAT Solvers
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
Gilles Audemard, George Katsirelos, Laurent Simon
COLT
2001
Springer
14 years 27 days ago
Learning Additive Models Online with Fast Evaluating Kernels
Abstract. We develop three new techniques to build on the recent advances in online learning with kernels. First, we show that an exponential speed-up in prediction time per trial ...
Mark Herbster