An ensemble approach for incremental learning in nonstationary environments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4472 LNCS, Issue , 2007, Pages 490-500

  Muhlbaier, Michael D ^a   Polikar, Robi ^a  

^a Rowan University   (United States)

Author keywords

Concept drift; Learn++.NSE; Nonstationary environment

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTER SIMULATION; DATA REDUCTION; DISTRIBUTION FUNCTIONS; DYNAMIC PROGRAMMING;

APPROPRIATE VOTING WEIGHTS; INCREMENTAL LEARNING; NONSTATIONARY ENVIRONMENT; TRAINING DATASETS;

LEARNING ALGORITHMS;

EID: 34548217482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72523-7_49     Document Type: Conference Paper

References (19)

1. Schlimmer, J. C. and Granger, R. H.; Incremental Learning from Noisy Data. Machine Learning 1 (1986) 317-354.
2. Helmbold, D. P. and Long, P. M.; Tracking drifting concepts by minimizing disagreements. Machine Learning 14 (1994) 27-45.
3. Widmer, G. and Kubat, M.; Learning in the presence of concept drift and hidden contexts. Machine Learning 23 (1996) 69-101.
4. Case, J., Jain, S., Kaufmann, S., Sharma, A., and Stephan, F.; Predictive learning models for concept drift. Theoretical Computer Science 268 (2001) 323-349.
5. Liao, Y., Vemuri, V. R., and Pasos, A.; Adaptive anomaly detection with evolving connectionist systems. Journal of Network and Computer Applications 30 (2007) 60-80.
6. Castillo, G., Gama, J., and Medas, P.; Adaptation to Drifting Concepts. Progress in Artificial Intelligence, Lecture Notes in Computer Science 2902 (2003) 279-293.
7. Gama, J., Medas, P., Castillo, G., and Rodrigues, P.; Learning with Drift Detection. Advances in Artificial Intelligence - SBIA 2004, Lecture Notes in Computer Science 3171 (2004) 286-295.
8. Cohen, L., Avrahami-Bakish, G., Last, M., Kandel, A., and Kipersztok, O.; Real-time data mining of non-stationary data streams from sensor networks. Information Fusion In Press, (2007).
9. Maloof, M. A. and Michalski, R. S.; Incremental learning with partial instance memory. Artificial Intelligence 154 (2004) 95-126.
10. Black, M. and Hickey, R.; Learning classification rules for telecom customer call data under concept drift. Soft Computing - A Fusion of Foundations, Methodologies and Applications 8 (2003) 102-108.
11. Rutkowski, L.; Adaptive probabilistic neural networks for pattern classification in time-varying environment. IEEE Transactions on Neural Networks 15 (2004) 811-827.
12. Cheng-Kui, G., Zheng-Ou, W., and Ya-Ming, S.; Encoding a priori information in neural networks to improve its modeling performance under non-stationary environment. International Conference on Machine Learning and Cybernetics (ICMLC 2004) 5 (2004) 3068-3072.
13. Kuncheva, L. I.; Classifier Ensembles for Changing Environments. Multiple Classifier Systems (MCS 2004), Lecture Notes in Computer Science 3077 (2004) 1-15.
14. Blum, A.; Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain. Machine Learning 26 (1997) 5-23.
15. Oza, N.; Online Ensemble Learning, Ph.D. Dissertation, (2001) University of California, Berkeley.
16. Kyosuke, N., Koichiro, Y., and Takashi, O.; ACE: Adaptive Classifiers-Ensemble System for Concept-Drifting Environments. Multiple Classifier Systems (MCS 2005), Lecture Notes in Computer Science 3541 (2005) 176-185.
17. Street, W. N. and Kim, Y.; A streaming ensemble algorithm (SEA) for large-scale classification. Seventh ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD-01), (2001) 377-382.
18. Chu, F. and Zaniolo, C.; Fast and Light Boosting for Adaptive Mining of Data Streams. Advances in Knowledge Discovery and Data Mining, Lecture Notes in Computer Science 3056 (2004) 282-292.
19. Polikar, R., Upda, L., Upda, S. S., and Honavar, V.; Learn++: an incremental learning algorithm for supervised neural networks. Systems, Man and Cybernetics, Part C, IEEE Transactions on 31 (2001) 497-508.