Database, Decision Tree, Random Forest, Entropy, Gini Index.
with respect to A) Branch nodes: a fixed attribute x in A. Edges: values of x. Leaf nodes: the value of t after a path from the root. In order to build a decision tree, we follow this algorithm: First, we construct a root node that includes all the examples, then for each node: If there are both