Abstract
The method of stochastic discrimination (SD) introduced by Kleinberg ([6,7]) is a new method in pattern recognition. It works by producing weak classifiers and then combining them via the Central Limit Theorem to form a strong classifier. SD is overtraining-resistant, has a high convergence rate, and can work quite well in practice. However, some strict assumptions involved in SD and the difficulties in understanding SD have limited its practical use. In this paper, we present a simple algorithm of SD for two-class pattern recognition. We illustrate the algorithm by applications in classifying the feature vectors from some real and simulated data sets. The experimental results show that SD is fast, effective, and applicable.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Berlind, R.: An Alternative Method of Stochastic Discrimination with Applications to Pattern Recognition. Doctoral Dissertation, Dept. of Mathematics, State University of New York at Buffalo (1994)
Chen, D., Huang, P., Cheng, X.: A Concrete Statistical Realization of Kleinberg’s Stochastic Discrimination for Pattern Recognition, Part I. Two-Class Classification. Submitted for Publication
Ho, T. K.: Random Decision Forests. In: Kavanaugh, M., Storms, P. (eds.): Proceedings of the Third International Conference on Document Analysis and Recognition. IEEE Computer Society Press, New York (1995) 278–282
Ho, T. K.: The Random Subspace Method for Constructing Decision Forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 20 (1998) 832–844
Johnson, R. A., Wichern, D. W.: Applied Multivariate Statistical Analysis. 4th edn. Prentice Hall (1998)
Kleinberg, E. M.: Stochastic Discrimination. Annals of Mathematics and Artificial Intelligence 1 (1990) 207–239
Kleinberg, E.M.: An Overtraining-Resistant Stochastic Modeling Method for Pattern Recognition. Annals of Statistics 24 (1996) 2319–2349
Kleinberg, E. M., Ho, T. K.: Building Projectable Classifiers of Arbitrary Complexity. In: Kavanaugh, M. E., Werner, B. (eds.): Proceedings of the 13th International Conference on Pattern Recognition. IEEE Computer Society Press, New York (1996) 880–885
Ripley, B. D.: Pattern Recognition and Neural Networks. Cambridge University Press, Cambridge (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, D., Cheng, X. (2000). A Simple Implementation of the Stochastic Discrimination for Pattern Recognition. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_91
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive