Sciweavers

334 search results - page 1 / 67
» The Alternating Decision Tree Learning Algorithm
Sort
View
ICML
1999
IEEE
14 years 5 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
ECML
2007
Springer
13 years 11 months ago
Decision Tree Instability and Active Learning
Decision tree learning algorithms produce accurate models that can be interpreted by domain experts. However, these algorithms are known to be unstable – they can produce drastic...
Kenneth Dwyer, Robert Holte
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 5 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 2 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 5 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford