334 search results - page 4 / 67 » The Alternating Decision Tree Learning Algorithm |
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
89
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
69
Voted
COLT
2003
Springer
15 years 2 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
IEAAIE
1995
Springer
15 years 1 months ago
1995
Springer
Classification learning has been dominated by the induction of axisorthogonal decision surfaces. While induction of alternate forms of decision surface has received some attentio...
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we investigate privacy-preserving data imputation on distributed databases. We present a privacypreserving protocol for filling in missing values using a lazy deci...