Random forest algorithm
Download as PPTX, PDF3 likes3,899 views
The document discusses the random forest algorithm. It introduces random forest as a supervised classification algorithm that builds multiple decision trees and merges them to provide a more accurate and stable prediction. It then provides an example pseudocode that randomly selects features to calculate the best split points to build decision trees, repeating the process to create a forest of trees. The document notes key advantages of random forest are that it avoids overfitting and can be used for both classification and regression tasks.
1 of 10
Downloaded 87 times
More Related Content
What's hot (20)
Similar to Random forest algorithm (20)
PPTX
Low power vlsi implementation adaptive noise cancellor based on least means s...shaik chand bashaAd
More from Rashid Ansari (13)
Ad
Recently uploaded (20)
PDF
“Voice Interfaces on a Budget: Building Real-time Speech Recognition on Low-c...Edge AI and Vision AlliancePDF
“NPU IP Hardware Shaped Through Software and Use-case Analysis,” a Presentati...Edge AI and Vision Alliance“Voice Interfaces on a Budget: Building Real-time Speech Recognition on Low-c...Edge AI and Vision Alliance
“NPU IP Hardware Shaped Through Software and Use-case Analysis,” a Presentati...Edge AI and Vision Alliance
Random forest algorithm
- 2. INTRODUCTION Random forest algorithm is a supervised classification algorithm. More trees in the forest the more robust the forest looks like. Same way in random forest classifier, the higher the number of trees in the forest gives the high accuracy results.
- 3. INTRODUCTION IN SIMPLE WORDS Random forest builds multiple decision trees And mergers them together to get a more accurate And stable prediction
- 5. How Random Forest Algorithm Works Data Data Subset 1 Data Subset 2 Data Subset 3 Data Subset n
- 6. How Random Forest Algorithm Works
- 7. Random Forest pseudocode Randomly select “k” features from total “m” features. K<m Among “k” features, calculate the node “d” using the best split point. Split the node into daughter modes using the best split. Repeat 1 to 3 steps until “I” number of nodes has been reached. Build forest by repeating steps 1 to 4 for “n” number times to create “n” number of trees.
- 8. APPLICATION
- 9. ADVANTAGES The overfitting problem will never come when we use the random forest algorithm in any classification problem. It can be used for both classification and regression task.
- 10. THANKYOU