Abstract
Number of components and initial parameter estimates are of crucial importance for sueeessful mixture estimation using Expectation-Maximization (EM) algorithm. In the paper a method for the complete mixture initialization based on a product kernel estimate of probability density function is proposed. The mixture components are assumed here to correspond to local maxima of optimally smoothed kerne Idensity estimate. The gradient method is used for local extrema finding. Then, local extrema are grouped together to form component eandidates and these are merged by the 4hierarchical clustering method. Finally, the initial mixture parameters are estimated. A comparison to scale-space approaches for finding of the number of components is given on examples.
This is a preview of subscription content, log in via an institution to check access.
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
G. Celeux and G. Soromenho. An entropy criterion for assessing the number of clusters in a mixture model. Journal of Classification, 13: 195–212, 1996.
S. V. Chakravarthy and J. Ghosh. Scale-Based Clustering Using the Radial Basis Function Network. IEEE Trans. on Neural Networks, 7(5):1250–1261, 1996.
A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via EM algorithm. J. Royal Stat.Soc. vol.39, pp. 1–38, 1977.
J. Grim, J. Novovicova, P. Pudil, P. Somol, and F. Ferri. Initialization normal mixtures of densities. In Proceedings of the 14th ICPR, pages 886–890, Australia, 1998.
N. Kehtamavaz and E. Nakamura. Generalization of the EM algorithm for mixture density estimation. Pattern Recognition Letters, 19:133–140, 1998.
R. Kothari and D. Pitts. On finding the number of clusters. Pattern Recognition Letters, 20:405–416, 1999.
T. Lindeberg. Scale-space theory: A basic tool for analysing structures at different scales. Journal of Applied Statistics, 21(2):225–270, 1994.
P. Paclfk, J. Novovicova, P. Pudil, and P. Somol. Road Sign Classification using Laplace Kernel Classifier. Pattern Recognition Letters, 21(13–14): 1165–1173, 2000.
H. Tenmoto, M. Kudo, and M. Shimbo. MDL-Based Selection of the Number of Components in Mixture Models for Pattern Recognition. In Lecture Notes in Computer Science 1451: Advances in Pattern Recognition, pages 831–836, 1998.
D. Titterington, A. Smith, and U. Makov. Statistical analysis of finite mixture distributions. John Wiley & Sons: Chichecter, Singapore, New York, 1985.
N. Ueda and R. Nakano. Deterministic annealing EM algorithm. Neural Networks, (11):271–282, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Wien
About this paper
Cite this paper
Paclík, P., Novovičová, J. (2001). Number of Components and Initialization in Gaussian Mixture Model for Pattern Recognition. In: Kůrková, V., Neruda, R., Kárný, M., Steele, N.C. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6230-9_101
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6230-9_101
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83651-4
Online ISBN: 978-3-7091-6230-9
eBook Packages: Springer Book Archive