Decision Tree Classification Algorithm

 

  • 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.
  • In a Decision tree, there are two nodes, which are the Decision Node and Leaf Node. Decision nodes are used to make any decision and have multiple branches, whereas Leaf nodes are the output of those decisions and do not contain any further branches.
  • The decisions or the test are performed on the basis of features of the given dataset.
  • It is a graphical representation for getting all the possible solutions to a problem/decision based on given conditions.
  • It is called a decision tree because, similar to a tree, it starts with the root node, which expands on further branches and constructs a tree-like structure.
  • In order to build a tree, we use the CART algorithm, which stands for Classification and Regression Tree algorithm.
  • A decision tree simply asks a question, and based on the answer (Yes/No), it further split the tree into subtrees.
  • Below diagram explains the general structure of a decision tree:

    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.

  • How does the Decision Tree algorithm Work?

    In a decision tree, for predicting the class of the given dataset, the algorithm starts from the root node of the tree. This algorithm compares the values of root attribute with the record (real dataset) attribute and, based on the comparison, follows the branch and jumps to the next node.

    For the next node, the algorithm again compares the attribute value with the other sub-nodes and move further. It continues the process until it reaches the leaf node of the tree. The complete process can be better understood using the below 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.

Comments

Post a Comment

Popular posts from this blog

DBMS - Program 6 - Insurance Database

Image
  6. INSURANCE DATABASE Consider the Insurance database given below. The primary keys are underlined and the data types are specified. PERSON (Driverld: text; Name: text; Address: text) CAR (RegNo: text; Model: text; Year: number) OWNS (DriverId: text; RegNo: text) ACCIDENT (ReportNo: number, AccDate: Date; Location: text) PARTICIPATED (DriverId; text; RegNo: text; ReportNo; number, Dmg_Amt:number (10, 2)) a)   Create the above tables by specifying the primary and foreign keys. b) Enter at least five tuples for each relation c)   Update the damage amount for each car accident. d) Add a new accident to the database. e)   Find the total number of people who owned cars that were involved in accidents in the                                                                                              year 2002. f)   Find the number of accidents in which cars belonging to a specific model were involved. g) Display the owners and their car deta ils.   Cre
Read more

Types of Addressing modes

Image
  Implied / Implicit Addressing Mode Stack Addressing Mode Immediate Addressing Mode Direct Addressing Mode Indirect Addressing Mode Register Direct Addressing Mode Register Indirect Addressing Mode Relative Addressing Mode Indexed Addressing Mode Base Register Addressing Mode Auto-Increment Addressing Mode Auto-Decrement Addressing Mode 1. Implied Addressing Mode-   In this addressing mode, The definition of the instruction itself specify the operands implicitly. It is also called as  implicit addressing mode .   Examples-   The instruction “Complement Accumulator” is an implied mode instruction. In a stack organized computer, Zero Address Instructions are implied mode instructions. (since operands are always implied to be present on the top of the stack)   2. Stack Addressing Mode-   In this addressing mode, The operand is contained at the top of the stack.   Example-   ADD This instruction simply pops out two symbols contained at the top of the stack. The addition of those two opera
Read more

Java - Swing

  Swing  is a Java Foundation Classes JFC] library and an extension of the Abstract Window Toolkit [AWT]. Swing offers much-improved functionality over AWT, new components, expanded components features, excellent event handling with drag and drop support. Introduction of Java Swing Swing has about four times the number of User Interface [U1] components as AWT and is part of the standard Java distribution. By today’s application GUI requirements, AWT is a limited implementation, not quite capable of providing the components required for developing complex GUI’s required in modern commercial applications. The AWT component set has quite a few bugs and really does take up a lot of system resources when compared to equivalent Swing resources. Netscape introduced its Internet Foundation Classes [IFC] library for use with Java. Its Classes became very popular with programmers creating GUI’s for commercial applications. Swing is a Set Of API ( API- Set Of Classes and Interfaces ) Swing is Pro
Read more