Abstract
The expectation maximization (EM) algorithm is a widely used parameter approach for estimating the parameters of multivariate multinomial mixtures in a latent class model. However, this approach has unsatisfactory computing efficiency. This study proposes a fuzzy clustering algorithm (FCA) based on both the maximum penalized likelihood (MPL) for the latent class model and the modified penalty fuzzy c-means (PFCM) for normal mixtures. Numerical examples confirm that the FCA-MPL algorithm is more efficient (that is, requires fewer iterations) and more computationally effective (measured by the approximate relative ratio of accurate classification) than the EM algorithm.
Similar content being viewed by others
References
Akaike H. 1973. Information theory and on an extension of the maximumlikelihood principle. In: Petrov B.N. and Csake F. (Eds.), Second International Symposium on Information Theory. Akademiai Kiado, Budapest.
Bezdek J.C. 1981. Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum, New York.
Bozdogan H. and Sclove S.L. 1984. Multi-sample cluster analysis using Akaike’s information criterion. Annals of the Institute of Statistical Mathematics 36: 163–180.
Carroll J.D., Green P.E., and Schaffer C.M. 1986. Interpoint distance comparisons in correspondence analysis. Journal of Marketing Research 22: 271–281.
Celeux G. and Govaert G. 1991. Clustering criteria for discrete data and latent class models. Journal of Classification 8: 157–176.
Dave R.N. and Krishnapuram R. 1997. Robust clustering methods: A unified view. IEEE Transactions on Fuzzy Systems 5: 270–293.
Dayton C.M. 1998. Latent class scaling analysis. SAGE, California.
Dempster A.P., Laird N.M., and Rubin D.B. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Roy Statistical Society Series B 39: 1–38.
Duda R.O., Hart P.E., and Stork D.G. 2001. Pattern Classification. John Wiley, New York.
Everitt B.S. 1984. An Introduction to LatentVariable Models. Chapman and Hall, New York.
Goodman L.A. 1974. Exploratory latent structure analysis using both identifiable and unidentifiable models. Biometrika 61: 215–231.
Hartigan J.A. 1975. Clustering Algorithms. John Wiley, New York.
Hunt L.A. and Jorgensen M.A. 1999. Mixture model clustering: A brief introduction to the MULTIMIX program. Australian and New Zealand Journal of Statistics 41: 153–171.
Lazarsfeld P.F. and Henry N.W. 1968. Latent Structure Analysis. Houghton Mifflin, Boston.
Lin C.T., Chen C.B., and Wu W.H. 2003. Convergence Properties of the Fuzzy Clustering Algorithm for Latent Class Model (submitted).
McLachlan G.J. and Basford K.E. 1988. Mixture Models: Inference and Applications to Clustering. Marcel Dekker, New York.
Ruspini E. 1969. Anewapproach to clustering. Information and Control 15: 22–32.
Segal M.R., Bacchetti P., and Jewell N.P. 1994. Variances for maximum penalized likelihood estimates obtained via the EM algorithm. Journal of Royal Statistical Society Series B 56: 345–352.
Trauwaert E., Kaufman L., and Rousseeuw P. 1991. Fuzzy clustering algorithms based on the maximum likelihood principle. Fuzzy Sets and Systems 42: 213–227.
Yang M.S. 1993. On a class of fuzzy classification maximum likelihood procedures. Fuzzy Sets and Systems 57: 365–375.
Yang M.S. and Su C.F. 1994. On parameter estimation for normal mixtures based on fuzzy clustering algorithms. Fuzzy Sets and Systems 68: 13–28.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lin, CT., Chen, CB. & Wu, WH. Fuzzy clustering algorithm for latent class model. Statistics and Computing 14, 299–310 (2004). https://doi.org/10.1023/B:STCO.0000039479.56180.d5
Issue Date:
DOI: https://doi.org/10.1023/B:STCO.0000039479.56180.d5