Alternating decision tree

Known as: ADTree 
An alternating decision tree (ADTree) is a machine learning method for classification. It generalizes decision trees and has connections to boosting… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2017
051019852017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Decision trees are comprehensible, but at the cost of a relatively lower prediction accuracy compared to other powerful black-box… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2015
2015
Alternating decision tree (ADTree) is a special decision tree representation that brings interpretability to boosting, a well… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2014
2014
This paper presents a machine learning approach for assessing the reliability of protein–protein interactions in a high… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
About 50% of the patients diagnosed with heart failure die within four years. At the same time, a rise in home telemonitoring of… (More)
Is this relevant?
2013
2013
Dengue fever is a flu-like illness spread by the bite of an infected mosquito which is fast emerging as a major health problem… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2010
2010
Complex number features are ubiquitous in many engineering and scientific applications. Many traditional classification… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The alternating decision tree (ADTree) is a successful classification technique that combines decision trees with the predictive… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2001
2001
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The application of boosting procedures to de cision tree algorithms has been shown to pro duce very accurate classi ers These… (More)
Is this relevant?
1985
1985
This work generalizes decision trees in order to study lower bounds on the running times of algorithms that allow probabilistic… (More)
  • table I
  • figure 1
Is this relevant?