Red-RF: Reduced Random Forest for Big Data Using Priority Voting & Dynamic Data Reduction
Authors:
- Hussein MohsenHMHussein Mohsen
- Hasan KurbanHKHasan Kurban
- Kurt ZimmerKZKurt Zimmer
- Mark JenneMJMark Jenne
- Mehmet M. DalkilicMDMehmet M. Dalkilic
- 1 June 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 118-125
Abstract
Random Forests have been used as effective ensemble models for classification. We present in this paper a new type of Random Forests (RFs) called Red(uced) RF that adopts a new dynamic data reduction principle and a new voting mechanism called Priority Vote Weighting (PV) which improve accuracy, execution time and AUC values compared to Breiman's 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 and Breiman's RF in 8 experiments that involve classification problems with datasets of different sizes. Finally, we conduct 2 additional experiments that involve considerably big datasets with one million points in each.Keywords
This publication has 14 references indexed in Scilit:
- A new set of Random Forests with varying dynamic data reduction and voting techniques2014
- Studying the Milky Way Galaxy Using ParaHeap-kComputer, 2014
- Impact of HbA1c Measurement on Hospital Readmission Rates: Analysis of 70,000 Clinical Database Patient RecordsBioMed Research International, 2014
- pROC: an open-source package for R and S+ to analyze and compare ROC curvesBMC Bioinformatics, 2011
- On Oblique Random Forests2011
- Search for the smallest random forestStatistics and Its Interface, 2009
- Enriched random forestsBioinformatics, 2008
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Bagging predictorsMachine Learning, 1996
- Learning classification treesStatistics and Computing, 1992