Alternating Decision Tree Algorithm

From GM-RKB
Revision as of 03:20, 16 August 2021 by Gmelli (talk | contribs) (Text replacement - "([^\s])([\s]{1,7})\<P\>" to "$1 <P>")
Jump to navigation Jump to search

An Alternating Decision Tree Algorithm is a decision tree algorithm that ...



References

2017

  • (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/alternating_decision_tree Retrieved:2017-11-7.
    • An alternating decision tree (ADTree) is a machine learning method for classification. It generalizes decision trees and has connections to boosting.

      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.