An incremental extremely random forest classifier for online learning and tracking

Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitations (even fail) with small data stream. In fact, there exist many real instances with small data stream. In the paper, we propose a novel incremental extremely random forest algorithm, dealing with online learning classification with small streaming data. In our method, arriving examples are stored at the leaf nodes and used to determine when to split the leaf nodes combined with Gini index, so the trees can be expanded efficiently with a few examples. Our algorithm has been applied to solve both online learning and video object tracking problems, and the results on UCI datasets and challenging video sequences demonstrate its effectiveness and robustness.

• Type: Journal
• Year: 2009
• Where: ICIP
• Authors: Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li
• Keywords: Decision Trees, Decision Trees Induction, ICIP 2009, Image Processing, Small Data Stream