Professional Documents
Culture Documents
Classification
Classification
The K value in KNN algorithm is the nearest Here, the choice became obvious as all three votes
neighbor we wish to take vote from. Let’s s assume from the closest neighbor went to RC. Thus, the
K = 3. choice of the parameter K is very crucial in this
algorithm.
HOW DO WE CHOOSE K VALUE
According to the example given before, the 6 training observation remain constant
and the different boundaries of K value.
These decision boundaries will segregate RC from GS.
Bootstraping
HOW RANDOM FOREST WORKS
The tree 1 and 3 classifies it as an orange while tree 2 classifies it as a cherry.
Here, the majority of the tree in random forest is orange. Thus, the fruit that
we want to classifies earlier is orange.
WHY RANDOM
FOREST ?