Scribd
Upload
5 views4 pages

MLLR - Tree Construction

Uploaded by

ᴘᴀᴠᴀɴ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views4 pages

MLLR - Tree Construction

Uploaded by

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

School: ............................................................................................................. Campus: .......................................................

Academic Year: ...................... Subject Name: ........................................................... Subject Code: ..........................

Semester: ............... Program: ........................................ Branch: ......................... Specialization: ..........................

Date: .....................................

(Learning by Doing and Discovery)

* Coding Phase: Pseudo Code / Flow Chart / Algorithm


What is Tree :
A tree in machine learning refers to a tree-based model that uses a branching structure to
represent decisions and their possible outcomes. These models are part of supervised learning algorithms
and are particularly effective for classification and regression tasks. The two most common types of tree-
based models are Decision Trees and Regression Trees.

What is a Decision Tree :


A Decision Tree is a supervised machine learning algorithm that is used for
both classification and regression tasks. It works by recursively splitting the dataset into subsets based on
the most significant feature at each step, creating a tree-like model of decisions.

What is a Decision Tree Classifier :


A Decision Tree Classifier is a type of supervised learning algorithm
used for solving classification problems. It uses a tree-like structure where each internal node represents a
"test" or decision based on a specific feature, each branch represents the outcome of the test, and each
leaf node represents a class label or category. The goal of the classifier is to split the dataset into subsets
that are as pure as possible in terms of class labels.
Flowchart :
Algorithm :
Step 1 : Import required libraries
Step 2 : Read the Iris dataset
Step 3 : Extract the Attributes / Features from the dataset
Step 4 : Create Train and Test subsets from the IRIS dataset
Step 5 : Create Decision Tree Classifier
Step 6 : Train the Decision Tree Classifier with X_train and
y_train
Step 7 : Test the trained classifier with test data X_test
Step 8 : Predict Accuracy Score
Step 9 : Show the confusion matrix
Step 10 : Show the evaluation metrics such as Precision, Recall,
F1-Score

*As applicable according to the experiment.


Two sheets per experiment (10-20) to be used.
Applied and Action Learning

Testing Phase: Compilation of Code (error detection)


No Error

*As applicable according to the experiment.


Two sheets per experiment (10-20) to be used.
Applied and Action Learning

Rubrics
Concept 10
Planning and Execution/ 10
Practical Simulation/ Programming
Result and Interpretation 10
Record of Applied and Action Learning 10
Viva 10
Total 50

Signature of the Faculty: Signature of the Student:

:
*As applicable according to the experiment.
Two sheets per experiment (10-20) to be used.
Applied and Action Learning

*As applicable according to the experiment.


Two sheets per experiment (10-20) to be used.

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