Detecting concept change in dynamic data streams: A sequential approach based on reservoir sampling

Machine Learning

Volumn 97, Issue 3, 2014, Pages 259-293

  Pears, Russel ^a   Sakthithasan, Sripirakas ^a   Koh, Yun Sing ^b  

^a AUCKLAND UNIVERSITY OF TECHNOLOGY   (New Zealand)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Concept drift detection; Data stream mining; Reservoir sampling; Sequential hypothesis testing

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA MINING;

CLASSIFICATION MODELS; CONCEPT DRIFTS; DATA STREAM MINING; FALSE POSITIVE AND FALSE NEGATIVES; KEY PERFORMANCE FACTORS; RESERVOIR SAMPLINGS; SEQUENTIAL CHANGE DETECTION; SEQUENTIAL HYPOTHESIS TESTING;

DATA STREAMS;

EID: 84910150798     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-013-5433-9     Document Type: Article

References (29)

1. Aggarwal, C. C., Han, J., Wang, J., & Yu, P. S. (2003). A framework for clustering evolving data streams. In VLDB endowment, VLDB ’03: Vol. 29. Proceedings of the 29th international conference on very large data bases (pp. 81–92).
2. Audibert, J. Y., Munos, R., & Szepesvári, C. (2007). Tuning bandit algorithms in stochastic environments. In Proceedings of the 18th international conference on algorithmic learning theory, ALT’07 (pp. 150–165). Berlin, Heidelberg: Springer.
3. Basseville, M., & Nikiforov, I. V. (1993). Detection of abrupt changes: theory and application. Upper Saddle River: Prentice-Hall.
4. Bernstein, S. N. (1946). The theory of probabilities. Moscow, Leningrad: Gostekhizdat.
5. Bifet, A., & Gavaldà, R. (2007). Learning from time-changing data with adaptive windowing. In Proceedings of the seventh SIAM international conference on data mining. Philadelphia: SIAM.
6. Bifet, A., & Gavaldà, R. (2009). Adaptive learning from evolving data streams. In Lecture notes in computer science: Vol. 5772. Advances in intelligent data analysis VIII (pp. 249–260). Berlin, Heidelberg: Springer.
7. Bifet, A., Holmes, G., Kirkby, R., & Pfahringer, B. (2010). MOA: massive online analysis. Journal of Machine Learning Research, 11, 1601–1604.
8. Borne, K. D. (2007). A machine learning classification broker for petascale mining of large-scale astronomy sky survey databases. In Next generation of data mining and cyber-enabled discovery for innovation (NGDM07). Baltimore: National Science Foundation.
9. Das, K., Sug, K. B., Giannella, C., & Kargupta, H. (2009). Scalable distributed change detection from astronomy data streams using local, asynchronous eigen monitoring algorithms. In SIAM international conference on data mining (SDM’09), Nevada (pp. 156–245). Philadelphia: SIAM.
10. Gama, J. (2010). Knowledge discovery from data streams (data mining and knowledge discovery series). Chapman and Hall/CRC data mining and knowledge discovery series. Minneapolis: CRC Press.
11. Gama, J., Medas, P., Castillo, G., & Rodrigues, P. P. (2004). Learning with drift detection. In Lecture notes in computer science: Vol. 3171. Proceedings of the 17th Brazilian symposium on artificial intelligence (Advances in artificial intelligence—SBIA 2004) (pp. 286–295). Berlin: Springer.
12. Ho, S. S. (2005). A martingale framework for concept change detection in time-varying data streams. In Proceedings of the 22nd international conference on machine learning, ICML ’05 (pp. 321–327). New York: ACM.
13. Hoeglinger, S., & Pears, R. (2007). Use of Hoeffding trees in concept based data stream mining. In Third international conference on information and automation for sustainability, ICIAFS 2007 (pp. 57–62). New York: IEEE Press.
14. Hoeglinger, S., Pears, R., & Koh, Y. S. (2009). CBDT: a concept based approach to data stream mining. In Proceedings of the 13th Pacific-Asia conference on advances in knowledge discovery and data mining, PAKDD ’09 (pp. 1006–1012). Berlin, Heidelberg: Springer.
15. Hulten, G., Spencer, L., & Domingos, P. (2001). Mining time-changing data streams. In Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’01, (pp. 97–106). New York: ACM.
16. Jose, M. B., Campo-Avila, J. D., Fidalgo, R., Bifet, A., Gavaldà, R., & Morales-bueno, R. (2006). Early drift detection method. In Proceedings of the 4th ECML PKDD int. workshop on knowledge discovery from data streams, Berlin (pp. 77–86).
17. Kifer, D., Ben-David, S., & Gehrke, J. (2004). Detecting change in data streams. In Proceedings of the thirtieth international conference on very large data bases, VLDB endowment, VLDB ’04 (Vol. 30, pp. 180–191).
18. Klinkenberg, R., & Joachims, T. (2000). Detecting concept drift with support vector machines. In Proceedings of the seventeenth international conference on machine learning, ICML ’00 (pp. 487–494). San Francisco: Morgan Kaufmann.
19. Kuncheva, L. I. (2013). Change detection in streaming multivariate data using likelihood detectors. IEEE Transactions on Knowledge and Data Engineering, 25(5), 1175–1180.
20. Maurer, A., & Pontil, M. (2009). Empirical Bernstein bounds and sample-variance penalization. In The 22nd conference on learning theory, COLT 2009.
21. Mnih, V., Szepesvári, C., & Audibert, J. Y. (2008). Empirical Bernstein stopping. In Proceedings of the 25th international conference on machine learning, ICML ’08 (pp. 672–679). New York: ACM.
22. Nishida, K., & Yamauchi, K. (2007). Detecting concept drift using statistical testing. In Proceedings of the 10th international conference on discovery science, DS’07 (pp. 264–269). Berlin, Heidelberg: Springer.
23. Page, E. S. (1954). Continuous inspection schemes. Biometrika, 41(1/2), 100–115.
24. Ross, G. J., Adams, N. M., Tasoulis, D. K., & Hand, D. J. (2012). Exponentially weighted moving average charts for detecting concept drift. Pattern Recognition Letters, 33(2), 191–198.
25. Sakthithasan, S., Pears, R., & Koh, Y. S. (2013). One pass concept change detection for data streams. In Lecture notes in computer science: Vol. 7819. Advances in knowledge discovery and data mining (pp. 461–472). Berlin, Heidelberg: Springer.
26. Sebastiao, R., & Gama, J. (2009). A study on change detection methods. In Proceedings of the 14th Portuguese conference on artificial intelligence, EPIA 2009 (pp. 353–364). Berlin, Heidelberg: Springer.
27. Shivaswamy, P. K., & Jebara, T. (2010). Empirical Bernstein boosting. In JMLR.org, JMLR proceedings: Vol. 9. Proceedings of the 13th international conference on artificial intelligence and statistics (AISTATS) (pp. 733–740).
28. Vitter, J. S. (1985). Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11(1), 37–57.
29. Widiputra, H., Pears, R., & Kasabov, N. (2011). Multiple time-series prediction through multiple time-series relationships profiling and clustered recurring trends. In Lecture Notes in Computer Science: Vol. 6635. Advances in knowledge discovery and data mining (pp. 161–172). Berlin, Heidelberg: Springer.