Adaboosting neural networks: Application to on-line character recognition

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

Volumn 1327, Issue , 1997, Pages 967-972

  Schwenk, Holger ^a   Bengio, Yoshua ^a,b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; CHARACTER RECOGNITION; DECISION TREES; NEURAL NETWORKS;

BOOSTING ALGORITHM; GENERAL METHOD; HANDWRITTEN DIGIT; MACHINE LEARNING PROBLEM; ONLINE CHARACTER RECOGNITION; SIMPLE LEARNING ALGORITHMS; TRAINING DATA; WRITING STYLE;

MACHINE LEARNING;

EID: 84956609453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0020278     Document Type: Conference Paper

References (10)

1. L. Breiman. Bias, variance, and Arcing classifiers. Technical Report 460, Statistics Departe-ment, University of California at Berkeley, 1996.
2. H. Drucker and C. Cortes, Boosting decision trees. In NIPS*8, pages 479-185, 1996.
3. Y. Freund and R.E. Schapire. Experiments with a new boosting algorithm. In Machine Learning: Proceedings of Thirteenth International Conference, pages 148-156, 1996.
4. Y. Freund and R.E. Schapire. A decision theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Science, to appear.
5. J.R. Quinlan. Bagging, Boosting and C4.5. In 14th Ntnl Conf. on Artificial Intelligence, 1996.
6. R.E. Schapire, Y. Freund, P. Bartlett, and W.S. Leee. Boosting the margin: A new explanation for the effectiveness of voting methods. In Machines That Learn - Snowbird, 1997.
7. H. Schwenk and M. Milgram. Transformation invariant autoassociation with application to handwritten character recognition. NIPS*7, pages 991-998. MIT Press, 1995.
8. H. Schwenk and M. Milgram. Learning discriminant tangent models for handwritten character recognition. In ICANN*96, pages 585-590. Springer Verlag, 1995.
9. H. Schwenk and M. Milgram. Constraint tangent distance for online character recognition. In International Conference on Pattern Recognition, pages D 520-524,1996.
10. P. Simard, Y. Le Cun, and J. Denker. Efficient pattern recognition using a new transformation distance. NIPS*5, pages 50-58. Morgan Kaufmann, 1993.