Scribd
Upload
12 views9 pages

Decision

A decision tree is a flowchart-like structure used for decision-making and predictions, consisting of nodes, branches, and leaf nodes. The process involves selecting the best attribute to split the dataset, recursively creating internal and leaf nodes until a stopping criterion is met. Key components include the root node, internal nodes, branches, and leaf nodes, each serving a specific role in the decision-making process.

Uploaded by

secrettilltheend22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
12 views9 pages

Decision

A decision tree is a flowchart-like structure used for decision-making and predictions, consisting of nodes, branches, and leaf nodes. The process involves selecting the best attribute to split the dataset, recursively creating internal and leaf nodes until a stopping criterion is met. Key components include the root node, internal nodes, branches, and leaf nodes, each serving a specific role in the decision-making process.

Uploaded by

secrettilltheend22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

DECISION

TREES
GROUP 1
What is a Decision Tree?

A decision tree is a flowchart-like structure used to


make decisions or predictions. It consists of nodes
representing decisions or tests on attributes, branches
representing the outcome of these decisions, and leaf
nodes representing final outcomes or predictions. Each
internal node corresponds to a test on an attribute,
each branch corresponds to the result of the test, and
each leaf node corresponds to a class label or a
continuous value.
STRUCTURE OF A DECISION TREE

Root Node: Represents the entire dataset and the


initial decision to be made.
Internal Nodes: Represent decisions or tests on
attributes. Each internal node has one or more
branches.
Branches : Represent the outcome of a decision or
test, leading to another node.
Leaf Nodes: Represent the final decision or
prediction. No further splits occur at these nodes.
HOW DECISION TREES WORK?

The process of creating a decision tree involves:


Selecting the Best Attribute: Using a metric like Gini
impurity, entropy, or information gain, the best attribute to
split the data is selected.
Splitting the Dataset: The dataset is split into subsets
based on the selected attribute.
Repeating the Process: The process is repeated recursively
for each subset, creating a new internal node or leaf node until
a stopping criterion is met (e.g., all instances in a node belong
to the same class or a predefined depth is reached).
Decision Tree
Database Schema
SQL Statement
Output
Thank You!

You might also like