Decision Tree Classifier: Machine Learning Laboratory

You might also like

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 8

Decision Tree Classifier

Machine Learning Laboratory


CSE 458
Decision Tree algorithm belongs to the family of supervised learning algorithms.
Basically Supervised learning is when we teach or train the machine using data that is
well-labelled.

The decision tree algorithm can be used for solving regression and classification
problems.

For example: Regression like that continuous nature. Predicting a person's income.
Classification like that Category nature. For example, Yes or No.

Decision Tree is one of the easiest and popular classification algorithms to


understand and interpret.
Tree structure
 Root Node
 Splitting
 Decision Node
 Leaf node
 Pruning
Weather

Sunny Cloudy Rain

Temp Yes No

Hot Mild Cold

No Yes Yes
Advantages
• Simple to understand

• Very useful for solving decision-related problems.

• It helps to think about all the possible outcomes for a problem.

• There is less requirement of data cleaning compared to other


algorithms.
• Unstable

• Complex calculations

Disadvantages • Biased information gain

• Higher training time

• Lower prediction accuracy


A Real Life Example

• Medical Diagnosis using Decision Tree


• Suppose a hospital wants to create a system to assist doctors in diagnosing
whether a patient has a particular medical condition, such as diabetes. The
dataset for training the decision tree includes various patient attributes like
age, body mass index (BMI), blood pressure, family history, and results from
specific medical tests.
Thank You

You might also like