Alternating decision tree
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.
Wikipage disambiguates
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Alternating decision tree
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.
has abstract
An alternating decision tree ( ...... tion nodes that are traversed.
@en
Un Árbol de decisión alternati ...... e predicción que es recorrida.
@es
Link from a Wikipage to an external page
Wikipage page ID
11,288,998
page length (characters) of wiki page
Wikipage revision ID
984,669,005
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
An alternating decision tree ( ...... tion nodes that are traversed.
@en
Un Árbol de decisión alternati ...... que contienen un solo número.
@es
label
Alternating decision tree
@en
Árbol de decisión alternativo
@es