Heuristic Updatable Weighted Random Subspaces for non-stationary environments

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 241-250

  Hoens, T Ryan ^a   Chawla, Nitesh V ^a   Polikar, Robi ^b  

^a University of Notre Dame   (United States)

^b Rowan University   (United States)

Author keywords

Concept drift; Hellinger distance; Non stationary learning; Random subspaces

Indexed keywords

CLASS LABELS; CONCEPT DRIFTS; DATA SETS; GENERATING FUNCTIONS; HELLINGER DISTANCE; NON-STATIONARY ENVIRONMENT; NONSTATIONARY; RANDOM SUBSPACE METHOD; RANDOM SUBSPACES; REAL-WORLD APPLICATION; TWO-STATE; WINDOW SIZE;

DATA MINING;

EID: 84857174050     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.75     Document Type: Conference Paper

References (33)

1. A. Bifet and R. Gavalda. Adaptive learning from evolving data streams. Advances in Intelligent Data Analysis VIII, pages 249-260, 2009.
2. A. Bifet, G. Holmes, R. Kirkby, and B. Pfahringer. Moa: Massive online analysis. JMLR, 11:1601-1604, 2010.
3. A. Bifet, G. Holmes, B. Pfahringer, R. Kirkby, and R. Gavaldà. New ensemble methods for evolving data streams. In KDD, pages 139-148. ACM, 2009.
4. L. Breiman. Bagging predictors. Machine Learning, 24(2):123-140, 1996.
5. W. Buntine. Learning classification trees. Statistics and Computing, 2(2):63-73, 1992.
6. D. Cieslak and N. Chawla. A framework for monitoring classifiers' performance: when and why failure occurs? KAIS, 18(1):83-108, 2009.
7. T. Dietterich. Ensemble methods in machine learning. MCS, pages 1-15, 2000.
8. P. Domingos and G. Hulten. Mining high-speed data streams. In KDD, pages 71-80. ACM, 2000.
9. Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. COLT, pages 23-37, 1995.
10. J. Gama, P. Medas, G. Castillo, and P. Rodrigues. Learning with drift detection. SBIA, pages 66-112, 2004.
11. S. Grossberg. Nonlinear neural networks: Principles, mechanisms, and architectures. Neural Networks, 1(1):17-61, 1988.
12. M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann, and I. H. Witten. The weka data mining software: an update. SIGKDD Explorations Newsletter, 11(1):10-18, 2009.
13. P. Halmos. Measure theory. Van Nostrand and Co., 1950.
14. M. Harries. Splice-2 comparative evaluation: Electricity pricing. 1999.
15. E. Hellinger. Neue begründung der theorie quadratischer formen von unendlichvielen veränderlichen (german). Journal fur die Reine und Angewandte Mathematik, 136:210-271, 1909.
16. T. Ho. The random subspace method for constructing decision forests. PAMI, 20(8):832-844, 1998.
17. W. Hoeffding. Probability inequalities for sums of bounded random variables. JASA, 58(301):13-30, 1963.
18. S. Hoeglinger and R. Pears. Use of hoeffding trees in concept based data stream mining. In ICIAFS, pages 57 -62, Dec 2007.
19. G. Hulten, L. Spencer, and P. Domingos. Mining timechanging data streams. In KDD, pages 97-106. ACM, 2001.
20. T. Kailath. The divergence and bhattacharyya distance measures in signal selection. IEEE Transactions on Communication Technology, 15(1):52-60, 1967.
21. I. Katakis, G. Tsoumakas, and I. Vlahavas. Dynamic feature space and incremental feature selection for the classification of textual data streams. Knowledge Discovery from Data Streams, pages 107-116, 2006.
22. I. Katakis, G. Tsoumakas, and I. Vlahavas. An Ensemble of Classifiers for coping with Recurring Contexts in Data Streams. In ECAI, pages 377-382, Patras, Greece, 2008.
23. I. Katakis, G. Tsoumakas, and I. Vlahavas. Tracking recurring contexts using ensemble classifiers: an application to email filtering. KAIS, 22(3):371-391, 2010.
24. R. Klinkenberg and T. Joachims. Detecting concept drift with support vector machines. In ICML. Citeseer, 2000.
25. R. Kohavi and C. Kunz. Option decision trees with majority votes. In ICML, pages 161-169, 1997.
26. J. Kolter and M. Maloof. Dynamic weighted majority: A new ensemble method for tracking concept drift. In ICDM, pages 123-130. IEEE, 2003.
27. R. Lichtenwalter and N. V. Chawla. Adaptive methods for classification in arbitrarily imbalanced and drifting data streams. In New Frontiers in Applied Data Mining, volume 5669 of Lecture Notes in Computer Science, pages 53-75. Springer Berlin / Heidelberg, 2010.
28. A. M. Oded Maron. Hoeffding races: Accelerating model selection search for classification and function approximation. In NIPS, volume 6, pages 59-66, April 1994.
29. B. Pfahringer, G. Holmes, and R. Kirkby. New options for hoeffding trees. AAI, pages 90-99, 2007.
30. F. Provost and P. Domingos. Tree induction for probabilitybased ranking. Machine Learning, 52(3):199-215, September 2003.
31. J. Quinlan. C4.5: programs for machine learning. 1993.
32. C. Rao. A review of canonical coordinates and an alternative to correspondence analysis using hellinger distance. Questiio (Quaderns d'Estadistica i Investigacio Operativa), 19:23-63, 1995.
33. A. Tsymbal. The problem of concept drift: definitions and related work. Informe técnico: TCD-CS-2004-15, Departament of Computer Science Trinity College, Dublin, https://www. cs.tcd.ie/publications/techreports/reports, 4:2004-15, 2004.