Using validation sets to avoid overfilling in adaBoost

FLAIRS 2006 - Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference

Volumn 2006, Issue , 2006, Pages 544-549

  Bylander, Tom ^a   Tate, Lisa ^a  

^a One UTSA Circle   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); DATABASE SYSTEMS; EDUCATION; STANDARDS;

OVERFILLING; TIME EFFICIENT MANNER; TRAINING SET; VALIDATION SETS;

LEARNING ALGORITHMS;

EID: 33746040864     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Blake, C. L., und Merz., C. J. 1998. UCI repository of machine learning databases.
2. Dietterich, T. 2000, Ensemble methods in machine learning. Lecture Notes in Computer Science. 1857:1-15.
3. Domingo, C., and Watanabe, O. 2000. Scaling up a boosting-based learner via adaptive sampling. In Pacific-Asia Conference on Knowledge Discovery and Data Mining, 317-328.
4. Elkan, C. 1997. Boosting and naive bayesian learning. Technical report. Department of Computer Science and Engineering, University of California, San Diego, CA, Freund, Y., and Schapire, R. E. 1996. Experiments with a new b(K)sting algorithm. In Proc. Thirteenth Int. Conf. on Machine Learning, 148-156.
5. Freund, Y., and Sehapire, R. E. 1997. A decision-theoretic generalization of on-line learning and an application to boosting, J. of Computer and System Sciences 55(1):119-139.
6. Freund, Y. 1990. Boosting a weak learning algorithm by majority. In COLT: Proceedings of the Workshop on Computational Learning Theory.
7. Freund, Y. 1999, An adaptive version of the boost by majority algorithm. In COLT: Proceedings of the Workshop on Computational Learning Theory.
8. Groves, A. J., and Schuurmans, D. 1998. Boosting in the limit; Maximizing the margin of learned ensembles. In Proc. Fifteenth Int. Conf. on Artificial Intelligence, 692-699.
9. Heskes, T. 1997. balancing between bagging and bumping. In Advances in Neural Information Processing Systems, 466,
10. Jiang, W. 2000. Process consistency for adaboost. Technical report, Department of Statistics, Northwestern University.
11. Nakamura, M.; Nomiya, H.; and Uehara, K. 2002. Improvement of boosting algorithm by modifying the weighting rule. In Annals of Mathematics and Artificail Intelligence, volume 41, 95-109.
12. Quinlan, J. R. 1996. Bagging, boosting, and C4.5. In Proc. Thirteenth National Conf. on Artificial Intelligence, 725-730.
13. Ratsch, G.; Onoda, T.; and Muller, K. R. 2001. Soft margins for adaboost. J. of Machine Learning 42(3):287-320.
14. Servedio, R. A. 2003. Smooth boosting and learning with malicious noise. J. of Machine Learning Research 4:633-648.
15. Ting, K. M., and Willen, I. H. 1997, Slacking bagged and bagged models. In Proc. 14th International Conference on Machine Learning, 367-375. Morgan Kaufmann.
16. Witten, I. H., and Frank, H. 2000. Data Mining: Practical machine learning tools with Jave implementations. San Francisco, California: Morgan Kaufmann.