BACHELOR OF BUSINESS ADMINISTRATION

Detailed explanation-1: -In a decision tree, each internal node (non-leaf node) denotes a test on an attribute, each branch represents an outcome of the test, and each leaf node (or terminal node) holds a class label. The topmost node in a tree is the root node.

Detailed explanation-2: -The bottom nodes of the decision tree are called leaves (or terminal nodes). For each leaf, the decision rule provides a unique path for data to enter the class that is defined as the leaf.

Detailed explanation-3: -The leaf nodes (green), also called terminal nodes, are nodes that don’t split into more nodes. Leaf nodes are where classes are assigned by majority vote.

Detailed explanation-4: -Leaf or Terminal Node: This is the end of the decision tree where it cannot be split into further sub-nodes. Pruning: Removing a sub-node from the tree is called pruning.

Detailed explanation-5: -Decision Tree Terminologies Root Node: Root node is from where the decision tree starts. It represents the entire dataset, which further gets divided into two or more homogeneous sets. Leaf Node: Leaf nodes are the final output node, and the tree cannot be segregated further after getting a leaf node.