The parsimonious Gaussian mixture models with partitioned parameters and their application in clustering

Niloofar Aslani Akhore Olyaei (), Mojtaba Khazaei () and Dariush Najarzadeh ()
Additional contact information
Niloofar Aslani Akhore Olyaei: Shahid Beheshti University
Mojtaba Khazaei: Shahid Beheshti University
Dariush Najarzadeh: University of Tabriz

Statistical Methods & Applications, 2024, vol. 33, issue 2, No 3, 407-437

Abstract: Abstract Cluster analysis is a method that identifies similar groups of data without any prior knowledge of the relevant groups. One of the most widely used clustering methods is model-based clustering, in which data clustering is performed by fitting a probabilistic model to the data. Mixture of Gaussian distributions is a commonly used model in model-based clustering. Unfortunately, the number of covariance matrices parameters rapidly increases by increasing the number of variables or components in these models. So far, various classes of the parsimonious Gaussian mixture models, by applying various constraints on the covariance matrices, have been introduced to solve this problem. Unfortunately, the number of models in each of these classes is so small such that in practice it does not allow the study and selection of models with any number of parameters, which can vary between the minimum number (one parameter) and the maximum number (no constraints model) of parameters. In this paper, to deal with this problem a family of the parsimonious Gaussian mixture models is introduced. This is done by identifying and determining the appropriate partitions of the variances and correlation coefficients between variables among clusters. We call these models “the parsimonious Gaussian mixture models with partitioned parameters". The generalized Expectation-Conditional Maximization algorithm, by employing the Fisher scoring method within the algorithm, is used to compute the maximum likelihood estimates of parameters. Bayesian information criterion is used for comparing and selecting the best model. Also, the steepest ascent method is adapted to search the best model. Finally, performances of these models are examined on two real datasets and a brief simulation study.

Keywords: Model-based clustering; Gaussian mixture models; Expectation-conditional maximization algorithm; Approximate fisher scoring algorithm; Steepest ascent method (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10260-023-00743-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:stmapp:v:33:y:2024:i:2:d:10.1007_s10260-023-00743-9

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10260/PS2

DOI: 10.1007/s10260-023-00743-9

Access Statistics for this article

Statistical Methods & Applications is currently edited by Tommaso Proietti

More articles in Statistical Methods & Applications from Springer, Società Italiana di Statistica
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().