1 Decision Tree Induction Decision tree induction is the learning of decision trees from class-labeled training tuples. A decision tree is a flowchart-like tree structure. Each internal node(non-leaf node)denotes a test on an attribute Each branch represents an outcome of the test. Each leaf node (or terminal node)holds a class label. The topmost node in a tree is the root node. ATA 13 Copyright 2019 by Xiaoyu Li.Copyright © 2019 by Xiaoyu Li. 13 1 Decision Tree Induction  Decision tree induction is the learning of decision trees from class-labeled training tuples.  A decision tree is a flowchart-like tree structure.  Each internal node(non-leaf node) denotes a test on an attribute  Each branch represents an outcome of the test.  Each leaf node (or terminal node) holds a class label.  The topmost node in a tree is the root node