Decision tree construction If all the records in u belong to the same class cu then n is a leaf node labeled as c If Un contains records that belong to more than one class, An attribute test condition is selected to partition the records into smaller subsets a child node is created for each outcome of the test condition The records in u are distributed to the children based on the outcomes The algorithm is then recursively applied to each child node 1/30/2021 PATTERN RECOGNITIONDecision tree construction If all the records in Un belong to the same class ck , then n is a leaf node labeled as ck . If Un contains records that belong to more than one class, ◦ An attribute test condition is selected to partition the records into smaller subsets. ◦ A child node is created for each outcome of the test condition. ◦ The records in Un are distributed to the children based on the outcomes. The algorithm is then recursively applied to each child node. 1/30/2021 PATTERN RECOGNITION 8