334 search results - page 13 / 67 » The Alternating Decision Tree Learning Algorithm |
AUSAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
AIPS
2008
14 years 12 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
ECML
2004
Springer
15 years 3 months ago
2004
Springer
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
AAAI
2006
14 years 11 months ago
2006
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
COLT
2004
Springer
15 years 1 months ago
2004
Springer
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...