Paired learners for concept drift

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 23-32

  Bach, Stephen H ^a   Maloof, Marcus A ^a  

^a GEORGETOWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPT DRIFTS; ENSEMBLE ALGORITHMS; MALWARE DETECTION; MEETING SCHEDULING; REAL WORLD DATA; SYNTHETIC PROBLEM; TARGET CONCEPT; TIME AND SPACE;

COMPUTER CRIME; EDUCATION; INFORMATION MANAGEMENT; MINING; WINDOWS;

FARM BUILDINGS;

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

References (18)

1. H. Becker and M. Arias. Real-time ranking with concept drift using expert advice. In Proceedings of the Thirteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 86-94. ACM Press, New York, NY, 2007. (Pubitemid 350229195)
2. A. Blum. Empirical support for winnow and weightedmajority algorithms: Results on a calendar scheduling domain. Machine Learning, 26:5-23, 1997. (Pubitemid 127722997)
3. P. Domingos and G. Hulten. Mining high-speed data streams. In Proceedings of the Sixth ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, pages 71-80. ACM Press, New York, NY, 2000.
4. J. Gama, P. Medas, and P. Rodrigues. Learning decision trees from dynamic data streams. In Proceedings of the 2005 ACM Symposium on Applied Computing (SAC-2005), pages 573-577. ACM Press, New York, NY, 2005. (Pubitemid 43302955)
5. M. Harries, C. Sammut, and K. Horn. Extracting hidden context. Machine Learning, 32(2):101-126, 1998.
6. G. Hulten, L. Spencer, and P. Domingos. Mining timechanging data streams. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 97-106. ACMPress, New York, NY, 2001.
7. J. Z. Kolter and M. A. Maloof. Using additive expert ensembles to cope with concept drift. In Proceedings of the Twenty-second International Conference on Machine Learning, pages 449-456. ACM Press, New York, NY, 2005. (Pubitemid 43183365)
8. J. Z. Kolter and M. A. Maloof. Learning to detect and classify malicious executables in the wild. Journal of Machine Learning Research, 7:2721-2744, 2006. (Pubitemid 46011490)
9. J. Z. Kolter and M. A. Maloof. Dynamic weighted majority: An ensemble method for drifting concepts. Journal of Machine Learning Research, 8:2755-2790, 2007.
10. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
11. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
12. T. M. Mitchell, R. Caruana, D. Freitag, J. McDermott, and D. Zabowski. Experience with a learning personal assistant. Communications of the ACM, 37(7):80-91, 1994.
13. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco, CA, 1993.
14. J. C. Schlimmer and R. H. Granger. Beyond incremental processing: Tracking concept drift. In Proceedings of the Fifth National Conference on Artificial Intelligence, pages 502-507. AAAI Press, Menlo Park, CA, 1986.
15. W. N. Street and Y. Kim. A streaming ensemble algorithm (SEA) for large-scale classification. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 377-382. ACM Press, New York, NY, 2001.
16. H. Wang, W. Fan, P. S. Yu, and J. Han. Mining conceptdrifting data streams using ensemble classifiers. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 226-235. ACM Press, New York, NY, 2003.
17. G. Widmer and M. Kubat. Learning in the presence of concept drift and hidden contexts. Machine Learning, 23:69-101, 1996. (Pubitemid 126737384)
18. I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, San Francisco, CA, 2nd edition, 2005.