Decision tree construction For each node, let p(ck) denotes the fraction of training records from class k In most cases the leaf node is assigned to the class that has the majority number of training records The fraction p(ck for a node can also be used to estimate the probability that a record assigned to that node belongs to class k 1/30/2021 PATTERN RECOGNITION 9Decision tree construction For each node, let p(ck ) denotes the fraction of training records from class k. In most cases, the leaf node is assigned to the class that has the majority number of training records. The fraction p(ck ) for a node can also be used to estimate the probability that a record assigned to that node belongs to class k. 1/30/2021 PATTERN RECOGNITION 9