Improved Weighted Random Forest for Classification Problems
Mohsen Shahhosseini, Guiping Hu

TL;DR
This paper proposes new weighted random forest algorithms that improve classification accuracy by adjusting the weights of individual trees based on performance metrics like accuracy and AUC.
Contribution
The paper introduces several novel weighting strategies for random forests, enhancing their predictive performance over traditional equal-weight models.
Findings
Weighted models outperform regular random forest in accuracy.
Performance-based weighting improves classification results.
Stacking-based weighted random forests show significant gains.
Abstract
Several studies have shown that combining machine learning models in an appropriate way will introduce improvements in the individual predictions made by the base models. The key to make well-performing ensemble model is in the diversity of the base models. Of the most common solutions for introducing diversity into the decision trees are bagging and random forest. Bagging enhances the diversity by sampling with replacement and generating many training data sets, while random forest adds selecting a random number of features as well. This has made the random forest a winning candidate for many machine learning applications. However, assuming equal weights for all base decision trees does not seem reasonable as the randomization of sampling and input feature selection may lead to different levels of decision-making abilities across base decision trees. Therefore, we propose several…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsFeature Selection
