Robust alternating AdaBoost

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

Volumn 4756 LNCS, Issue , 2007, Pages 427-436

  Allende Cid, Héctor ^a   Salas, Rodrigo ^b   Allende, Héctor ^a   Ñanculef, Ricardo ^a  

^a DEPARTAMENTO DE FÍSICA   (Chile)

^b UNIVERSIDAD DE VALPARAÍSO   (Chile)

Author keywords

AdaBoost; Machine ensembles; Robust learning algorithms

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA REDUCTION; PROBLEM SOLVING;

ADABOOST; MACHINE ENSEMBLES; ROBUST LEARNING ALGORITHMS;

LEARNING ALGORITHMS;

EID: 38449112056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (9)

1. Allende, H., Nanculef, R., Salas, R.: Bootstrapping neural networks. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds.) MICAI 2004. LNCS (LNAI), vol. 2972, pp. 813-822. Springer, Heidelberg (2004)
2. Bauer, E., Kohavi, R.: An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning 36(1-2), 105-139 (1999)
3. Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998)
4. Breiman, L.: Bagging predictors. Machine Learning 24(2), 123-140 (1996)
5. Duda, R., Hart, P., Stork, D.: Pattern classification. Wiley-Interscience, Chichester (2000)
6. Freund, Y., Schapire, R.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences 55(1), 119-139 (1997)
7. Kanamori, T., Takenouchi, T., Eguchi, S., Murata, N.: The most robust loss function for boosting. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol. 3316, pp. 496-501. Springer, Heidelberg (2004)
8. Kuncheva, L., Whitaker, C.: Using diversity with three variants of boosting: Aggressive, conservative and inverse. In: Roli, F., Kittler, J. (eds.) MCS 2002. LNCS, vol. 2364, pp. 81-90. Springer, Heidelberg (2002)
9. Valiant, L.G.: A theory of the learnable. Communications of the ACM 27(11), 1134-1142 (1984)