ML 1.9 DECISION TREE MODEL OF LEARNING
Decision Tree of Learning A Decision Tree is a supervised learning model used for classification and regression . A decision tree learns by splitting data into smaller and purer groups using simple rules , until it can confidently make a prediction. It makes decisions by splitting data into subsets based on feature values, forming a tree-like structure of rules. It learns by asking a sequence of simple questions about the data and splitting it step by step, like a flowchart, until it reaches a decision. Key Components of a Decision Tree: · Root Node : The topmost node representing the entire dataset, which is then split into subsets. · Decision Nodes : Intermediate nodes that represent decisions based on specific features, leading to further splits. · Leaf Nodes (Terminal Nodes) : Nodes that represent the final output or decision, containing no furthe...