Abstract
Random Forest is a popular decision forest building algorithm which focuses on generating diverse deci-sion trees as the base classifiers. For high dimensional data sets, Random Forest generally excels in generat-ing diverse decision trees at the cost of less accurate individual decision trees. To achieve higher prediction accuracy, a decision forest needs both accurate and diverse decision trees as the base classifiers. In this paper we propose a novel decision forest algorithm called Complement Random Forest that aims to gen-erate accurate yet diverse decision trees when applied on high dimensional data sets. We conduct an elab-orate experimental analysis on seven publicly avail-able data sets from UCI Machine Learning Reposi-tory. The experimental results indicate the effective-ness of our proposed technique.
Original language | English |
---|---|
Title of host publication | Proceedings of the Thirteenth Australasian Data Mining Conference (AusDM 15) |
Place of Publication | Australia |
Publisher | CRPIT |
Pages | 89-97 |
Number of pages | 9 |
Publication status | Published - 2015 |
Event | The 13th Australasian Data Mining Conference: AusDM 2015 - University of Technology, Sydney, Australia Duration: 08 Aug 2015 → 09 Aug 2015 https://web.archive.org/web/20150820140652/http://ausdm15.ausdm.org/ |
Conference
Conference | The 13th Australasian Data Mining Conference |
---|---|
Country/Territory | Australia |
City | Sydney |
Period | 08/08/15 → 09/08/15 |
Internet address |