Decision Tree in Machine Learning
0 likes2,005 views
The document discusses decision tree learning and provides details about key concepts and algorithms. It defines decision trees as tree-structured classifiers that use internal nodes to represent dataset features, branches for decision rules, and leaf nodes for outcomes. The document then describes common decision tree terminology like root nodes, leaf nodes, splitting, branches, and pruning. It also outlines the basic steps of a decision tree algorithm, which involves beginning with a root node, finding the best attribute, dividing the dataset, generating decision tree nodes recursively, and ending with leaf nodes. Finally, it discusses two common attribute selection measures - information gain and Gini index - that are used to select the best attributes for decision tree nodes.
Decision Tree in Machine Learning
- 1. Department of Computer Science & Engineering Topic : Decision Tree Learning Name: Souma Maiti Roll No. :27500120016 Subject: Machine Learning Subject Code : PEC-CS701E Year : 4th Semester: 7th
- 2. INTRODUCTION • Decision Tree is a Supervised learning technique that can be used for both classification and Regression problems, but mostly it is preferred for solving Classification problems. It is a tree- structured classifier, where internal nodes represent the features of a dataset, branches represent the decision rules and each leaf node represents the outcome. • It is a graphical representation for getting all the possible solutions to a problem/decision based on given conditions.
- 3. 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. • Splitting: Splitting is the process of dividing the decision node/root node into sub-nodes according to the given conditions. • Branch/Sub Tree: A tree formed by splitting the tree. • Pruning: Pruning is the process of removing the unwanted branches from the tree. • Parent/Child node: The root node of the tree is called the parent node, and other nodes are called the child nodes.
- 4. Decision Tree algorithm: • Step-1: Begin the tree with the root node, says S, which contains the complete dataset. • Step-2: Find the best attribute in the dataset using Attribute Selection Measure (ASM). • Step-3: Divide the S into subsets that contains possible values for the best attributes. • Step-4: Generate the decision tree node, which contains the best attribute. • Step-5: Recursively make new decision trees using the subsets of the dataset created in step -3. Continue this process until a stage is reached where you cannot further classify the nodes and called the final node as a leaf node.
- 5. Attribute Selection Measures: • While implementing a Decision tree, the main issue arises that how to select the best attribute for the root node and for sub-nodes. So, to solve such problems there is a technique which is called as Attribute selection measure or ASM. By this measurement, we can easily select the best attribute for the nodes of the tree. There are two popular techniques for ASM, which are: 1. Information Gain: • Information gain is the measurement of changes in entropy after the segmentation of a dataset based on an attribute. • It calculates how much information a feature provides us about a class. • According to the value of information gain, we split the node and build the decision tree. • A decision tree algorithm always tries to maximize the value of information gain, and a node/attribute having the highest information gain is split first. It can be calculated using the below formula: • Information Gain= Entropy(S)- [(Weighted Avg) *Entropy(each feature) • Entropy: Entropy is a metric to measure the impurity in a given attribute. It specifies randomness in data. 2. Gini Index: • Gini index is a measure of impurity or purity used while creating a decision tree in the CART(Classification and Regression Tree) algorithm. • An attribute with the low Gini index should be preferred as compared to the high Gini index. • It only creates binary splits, and the CART algorithm uses the Gini index to create binary splits. • Gini index can be calculated using the below formula: • Gini Index= 1- ∑jPj2