0% found this document useful (0 votes)
5 views5 pages

Random Forest Algorithm

Random Forest is a supervised learning technique used for both classification and regression, based on ensemble learning principles. It constructs multiple decision trees from various subsets of the dataset to enhance predictive accuracy. Key assumptions include the presence of actual values in feature variables and low correlations among predictions from individual trees.

Uploaded by

rv28.09.2003
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
0% found this document useful (0 votes)
5 views5 pages

Random Forest Algorithm

Random Forest is a supervised learning technique used for both classification and regression, based on ensemble learning principles. It constructs multiple decision trees from various subsets of the dataset to enhance predictive accuracy. Key assumptions include the presence of actual values in feature variables and low correlations among predictions from individual trees.

Uploaded by

rv28.09.2003
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/ 5

RANDOM FOREST

ALGORITHM
KEY FEATURES

• SUPERVISED LEARNING TECHNIQUE

• USED FOR BOTH CLASSIFICATION


AND REGRESSION

• BASED ON THE CONCEPT OF


ENSEMBLE LEARNING
OVERVIEW

• Random Forest is a
classifier that contains
a number of decision
trees on various
subsets of the given
dataset and takes the
average to improve the
predictive accuracy of
that dataset.

• The greater number of


trees in the forest
leads to higher
accuracy and prevents
the problem of
ASSUMPTONS FOR RANDOM FOREST

• There should be some actual values in


ASSUMPTION the feature variable of the dataset so
that the classifier can predict accurate
1 results rather than a guessed result.

• The predictions from each tree must


ASSUMPTION have very low correlations

2
HOW DOES IT WORKS

SELECT
RANDOM K
DATA POINT

BUILD THE
DECISION TREES
ASSOCIATED

CHOOSE THE
NUMBER N FOR
DECISION TREE

FOR NEW DATA


POINT FIND THE
PREDICTIONS

You might also like