Abstract
Methods that create several classifiers out of one base classifier, so-called ensemble creation methods, have been proposed and successfully applied to many classification problems recently. One category of such methods is Boosting with AdaBoost being the best known procedure belonging to this category. Boosting algorithms were first developed for two-class problems, but then extended to deal with multiple classes. Yet these extensions are not always suitable for problems with a large number of classes. In this paper we introduce some novel boosting algorithms which are designed for such problems, and we test their performance in a handwritten word recognition task.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Allwein, R. Schapire, and Y. Singer. Reducing multiclass to binary: A uniying approach for margin classifiers. Journal of Machine Learning Research, 1:113–141, 2000.
A. Brakensiek, J. Rottland, A. Kosmala, and G. Rigoll. Off-line handwriting recognition using various hybrid modeling techniques and character n-grams. In 7th International Workshop on Frontiers in Handwritten Recognition, pages 343–352, 2000.
L. Breiman. Bagging predictors. Machine Learning, (2):123–140, 1996.
T. G. Dietterich. Ensemble methods in machine learning. In F. Roli, editors. First International Workshop on Multiple Classifier Systems, Cagliari, Italy, 2000. Springer [12], pages 1–15.
T. G. Dietterich and G. Bakiri. Solving multiclass learning problems via error-correcting output codes. Journal of Artifical Intelligence Research, 2:263–286, 1995.
T.G. Dietterich and E.B. Kong. Machine learning bias, statistical bias, and statistical variance of decision tree algorithms. Technical report, Departement of Computer Science, Oregon State University, 1995.
Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256–285, 1995.
Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Science, 55(1):119–139, 1997.
T. K. Ho. The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8):832–844, 1998.
S. Impedovo, P. Wang, and H. Bunke, editors. Automatic Bankcheck Processing. World Scientific Publ. Co, Singapore, 1997.
G. Kim, V. Govindaraju, and S.N. Srihari. Architecture for handwritten text recognition systems. In S.-W. Lee, editor, Advances in Handwriting Recognition, pages 163–172. World Scientific Publ. Co., 1999.
J. Kittler and F. Roli, editors. First International Workshop on Multiple Classifier Systems, Cagliari, Italy, 2000. Springer.
J. Kittler and F. Roli, editors. Third International Workshop on Multiple Classifier Systems, Cagliari, Italy, 2002. Springer.
U. Marti and H. Bunke. The IAM-database: an English sentence database for offline handwriting recognition. Int. Journal of Document Analysis and Recognition, 5:39–46, 2002.
U.-V. Marti and H. Bunke. Using a statistical language model to improve the performance of an HMM-based cursive handwriting recognition system. Int. Journal of Pattern Recognition and Art. Intelligence, 15:65–90, 2001.
D. Partridge and W. B. Yates. Engineering multiversion neural-net systems. Neural Computation, 8(4):869–893, 1996.
L. Rabiner. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257–285, 1989.
R. Schapire. The strength of weak learner. Machine Learning, 5(2):197–227, 1990.
R. Schapire. Using output codes to boost multiclass learning problems. In Proc. of the 14th International Conference on Machine Learning, pages 313–321, 1997.
R. Schapire. The boosting approach to machine learning. an overview. In MSRI Workshop on Nonlinear Estimation and Classification, pages 149–172, 2002.
R. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3):297–336, 1999.
J.-C. Simon. Off-line cursive word recognition. Special Issue of Proc. of the IEEE, 80(7):1150–1161, July 1992.
S. Srihari. Handwritten address interpretation; a task of many pattern recognition problems. Int. Journal of Pattern Recognition and Art. Intell., 14:663–674, 2000.
C.Y. Suen, C. Nadal, R. Legault, T.A. Mai, and L. Lam. Computer recognition of unconstrained handwritten numerals. Special Issue of Proc. of the IEEE, 80(7):1162–1180, 1992.
L. Xu, A. Krzyzak, and C. Suen. Methods of combining multiple classifiers and their applications to handwriting recognition. IEEE Transactions on Systems, Man and Cybernetics, 22(3):418–435, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Günter, S., Bunke, H. (2003). New Boosting Algorithms for Classification Problems with Large Number of Classes Applied to a Handwritten Word Recognition Task. In: Windeatt, T., Roli, F. (eds) Multiple Classifier Systems. MCS 2003. Lecture Notes in Computer Science, vol 2709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44938-8_33
Download citation
DOI: https://doi.org/10.1007/3-540-44938-8_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40369-2
Online ISBN: 978-3-540-44938-6
eBook Packages: Springer Book Archive