A new set of Random Forests with varying dynamic data reduction and voting techniques
Authors:
- 1 October 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 399-405
Abstract
Random forests have been used as effective models to tackle a number of classification and regression problems. In this paper, we present a new type of Random Forests (RFs) called Red(uced)-RF that adopts a new voting mechanism called Priority Vote Weighting (PV) and a new dynamic data reduction principle which improve accuracy and execution time compared to Breiman's conventional RF. Red-RF also shows that the strength of a random forest can increase without noticeably increasing correlation between the trees. We then compare performance of Red-RF, 9 new RF variants and Breiman's RF in eight experiments that involve classification problems with datasets of different sizes.Keywords
This publication has 11 references indexed in Scilit:
- On Oblique Random Forests2011
- Search for the smallest random forestStatistics and Its Interface, 2009
- Statistical Instance-Based Pruning in Ensembles of Independent ClassifiersIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Enriched random forestsBioinformatics, 2008
- Random ForestsMachine Learning, 2001
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Bagging predictorsMachine Learning, 1996
- The Weighted Majority AlgorithmInformation and Computation, 1994
- Learning classification treesStatistics and Computing, 1992
- Multisurface method of pattern separation for medical diagnosis applied to breast cytology.Proceedings of the National Academy of Sciences, 1990