Department of Computer Science
Learning a mixture model for clustering with the completed likelihood minimum message length criterion
Mixture model based clustering (also simply called model-based clustering hereinafter) consists of fitting a mixture model to data and identifying each cluster with one of its components. This paper tackles the model selection and parameter estimation problems in model-based clustering so as to improve the clustering performance on the data sets whose true kernel distribution functions are not in the family of assumed ones, as well as with inherently overlapped clusters. Being tailored to clustering applications, an effective model selection criterion is first proposed. Unlike most criteria that measure the goodness-of-fit of the model only to generate data, the proposed one also evaluates whether the candidate model provides a reasonable partition for the observed data, which enforces a model with well-separated components. Accordingly, an improved method for the estimation of mixture parameters is derived, which aims to suppress the spurious estimates by the standard expectation maximization (EM) algorithm and enforce well-supported components in the mixture model. Finally, the estimation of mixture parameters and the model selection is integrated in a single algorithm which favors a compact mixture model with both the well-supported and well-separated components. Extensive experiments on synthetic and real-world data sets are carried out to show the effectiveness of the proposed approach to the mixture model based clustering. © 2013 Elsevier Ltd. All rights reserved.
Clustering, Completed likelihood, Finite mixture model, Minimum message length, Model selection
Source Publication Title
Link to Publisher's Edition
Zeng, H., & Cheung, Y. (2014). Learning a mixture model for clustering with the completed likelihood minimum message length criterion. Pattern Recognition, 47 (5), 2011-2030. https://doi.org/10.1016/j.patcog.2013.09.036