Gaussian parsimonious clustering models

• Published in: Pattern recognition Vol. 28; no. 5; pp. 781 - 793
• Main Authors: Celeux, Gilles, Govaert, Gérard
• Format: Journal Article
• Language: English
• Published: Oxford Elsevier Ltd 01.05.1995; Elsevier Science
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Cluster volumes; Computer science; control theory; systems; Eigenvalue decomposition; Exact sciences and technology; Gaussian mixture; Theoretical computing; Eigenvalue decomposition; Gaussian mixture; Cluster volumes; Eigenvalue; Parametrization; Cluster; Maximum likelihood; Optimization; Optimization method
• ISSN: 0031-3203; 1873-5142
• DOI: 10.1016/0031-3203(94)00125-6

Gaussian clustering models are useful both for understanding and suggesting powerful criteria. Banfield and Raftery, Biometriks 49, 803–821 (1993), have considered a parameterization of the variance matrix Σ k of a cluster P k in terms of its eigenvalue decomposition, Σ k = λ k D k A k D k ′ where λ k defines the volume of P k , D k is an orthogonal matrix which defines its orientation and A k is a diagonal matrix with determinant 1 which defines its shape. This parametrization allows us to propose many general clustering criteria from the simplest one (spherical clusters with equal volumes which leads to the classical k-means criterion) to the most complex one (unknown and different volumes, orientations and shapes for all clusters). Methods of optimization to derive the maximum likelihood estimates as well as the practical usefulness of these models are discussed. We especially analyse the influence of the volumes of clusters. We report Monte Carlo simulations and an application on stellar data which dramatically illustrated the relevance of allowing clusters to have different volumes.