Improving the performance of data stream classifiers by mining recurring contexts

  • Authors:
  • Yong Wang;Zhanhuai Li;Yang Zhang;Longbo Zhang;Yun Jiang

  • Affiliations:
  • Dept. Computer Science & Software, Northwestern Polytechnical University, China;Dept. Computer Science & Software, Northwestern Polytechnical University, China;School of Information Engineering, Northwest A&F University, China;Dept. Computer Science & Software, Northwestern Polytechnical University, China;Dept. Computer Science & Software, Northwestern Polytechnical University, China

  • Venue:
  • ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditional researches on data stream mining only put emphasis on building classifiers with high accuracy, which always results in classifiers with dramatic drop of accuracy when concept drifts. In this paper, we present our RTRC system that has good classification accuracy when concept drifts and enough samples are scanned in data stream. By using Markov chain and least-square method, the system is able to predict not only on which the next concept is but also on when the concept is to drift. Experimental results confirm the advantages of our system over Weighted Bagging and CVFDT, two representative systems in streaming data mining.