Lably
Skip to content

Alternating decision tree

Tree-based machine learning method for classification

  • 9 min read
  • 5 chapters

Related on Lably

Through Machine learning, Correlation and Frequency (statistics)

An ADTree consists of an alternation of decision nodes, which specify a predicate condition, and prediction nodes, which contain a single number. An instance is classified by an ADTree by following all paths for which all decision nodes are true, and summing any prediction nodes that are traversed.

History

ADTrees were introduced by Yoav Freund and Llew Mason. However, the algorithm as presented had several typographical errors. Clarifications and optimizations were later presented by Bernhard Pfahringer, Geoffrey Holmes and Richard Kirkby. Implementations are available in Weka and JBoost.

Sign in to keep reading

4 more chapters are free with a Lably account.

More in Robotics