Sciweavers

352 search results - page 34 / 71
» A Fast Decision Tree Learning Algorithm
Sort
View
COLT
2001
Springer
15 years 3 months ago
Agnostic Boosting
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
Shai Ben-David, Philip M. Long, Yishay Mansour
ICML
2006
IEEE
15 years 12 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
DATAMINE
2002
125views more  DATAMINE 2002»
14 years 11 months ago
High-Performance Commercial Data Mining: A Multistrategy Machine Learning Application
We present an application of inductive concept learning and interactive visualization techniques to a large-scale commercial data mining project. This paper focuses on design and c...
William H. Hsu, Michael Welge, Thomas Redman, Davi...
ICCV
2001
IEEE
16 years 29 days ago
Human Tracking with Mixtures of Trees
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
Sergey Ioffe, David A. Forsyth
ECAI
2004
Springer
15 years 4 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano