The Community for Technology Leaders
Green Image
Issue No. 01 - January (2011 vol. 23)
ISSN: 1041-4347
pp: 22-36
Patrick Martin , Queen's University, Kingston
Hanady Abdulsalam , Kuwait University, Kuwait
David B. Skillicorn , Queen's University, Kingston
ABSTRACT
We consider the problem of data stream classification, where the data arrive in a conceptually infinite stream, and the opportunity to examine each record is brief. We introduce a stream classification algorithm that is online, running in amortized {\cal O}(1) time, able to handle intermittent arrival of labeled records, and able to adjust its parameters to respond to changing class boundaries (“concept drift”) in the data stream. In addition, when blocks of labeled data are short, the algorithm is able to judge internally whether the quality of models updated from them is good enough for deployment on unlabeled records, or whether further labeled records are required. Unlike most proposed stream-classification algorithms, multiple target classes can be handled. Experimental results on real and synthetic data show that accuracy is comparable to a conventional classification algorithm that sees all of the data at once and is able to make multiple passes over it.
INDEX TERMS
Data stream mining, data stream classification, decision tree ensembles, random forests.
CITATION
Patrick Martin, Hanady Abdulsalam, David B. Skillicorn, "Classification Using Streaming Random Forests", IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 22-36, January 2011, doi:10.1109/TKDE.2010.36
98 ms
(Ver 3.1 (10032016))