Scribd
Upload
3 views

Decision Tree

A decision tree is a graphical representation used to visualize different choices and their potential outcomes, aiding in decision-making. It is primarily a supervised learning technique for classification problems, structured with decision nodes and leaf nodes to represent features and outcomes, respectively. The CART algorithm is commonly employed to build these trees, which can handle both categorical and numeric data.

Uploaded by

kostaroopali
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

Decision Tree

A decision tree is a graphical representation used to visualize different choices and their potential outcomes, aiding in decision-making. It is primarily a supervised learning technique for classification problems, structured with decision nodes and leaf nodes to represent features and outcomes, respectively. The CART algorithm is commonly employed to build these trees, which can handle both categorical and numeric data.

Uploaded by

kostaroopali
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Decision Tree

Last Updated : 16 Jan, 2025

Decision tree is a simple diagram that shows different choices and their possible results helping you
make decisions easily. Understanding Decision Tree

A decision tree is a graphical representation of different options for solving a problem and show how
different factors are related. It has a hierarchical tree structure starts with one main question at the
top called a node which further branches out into different possible outcomes

o 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.

o 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.

o The decisions or the test are performed on the basis of features of the given dataset.

o It is a graphical representation for getting all the possible solutions to a problem/decision


based on given conditions.

o 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.

o In order to build a tree, we use the CART algorithm, which stands for Classification and
Regression Tree algorithm.

o A decision tree simply asks a question, and based on the answer (Yes/No), it further split the
tree into subtrees.

o Below diagram explains the general structure of a decision tree:

o Note: A decision tree can contain categorical data (YES/NO) as


well as numeric data.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy