This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops
Online random forests based on CorrFS and CorrBE
Anchorage, AK, USA
June 23-June 28
ISBN: 978-1-4244-2339-2
Osman Hassab Elgawi, Tokyo Institute of Technology, Japan
This paper aims to contribute to the merits of online ensemble learning for classification problems. To this end we induce random forests algorithm into online mode and estimate the importance of variables incrementally based on correlation ranking (CR). We test our method by an “incremental hill climbing” algorithm in which features are greedily added in a “forward” step (FS), and removed in a “backward” step (BE). We resort to an implementation that combine CR with FS and BE. We call this implementation CorrFS and CorrBE respectively. Evaluation based on public UCI databases demonstrates that our method can achieve comparable performance to classifiers constructed from batch training. In addition, the framework allows a fair comparison among other batch mode feature selection approaches such as Gini index, ReliefF and gain ratio.
Citation:
Osman Hassab Elgawi, "Online random forests based on CorrFS and CorrBE," cvprw, pp.1-7, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008
Usage of this product signifies your acceptance of the Terms of Use.