A fast and efficient Modal EM algorithm for Gaussian mixtures. (8th June 2021)

• Record Type: Journal Article
• Authors: Scrucca, Luca
• Is Part Of: Statistical analysis and data mining. Volume 14:Number 4(2021)
• Page Start: 305
• Page End: 314
• Publication Date: 2021-06-08
• Subjects: cluster analysis -- density modes -- finite mixture of Gaussians -- Modal EM algorithm -- model‐based density estimation; Data mining -- Statistical methods -- Periodicals; 006.312
• DOI: 10.1002/sam.11527
• Languages: English
• ISSNs: 1932-1864

Abstract

Abstract: In the modal approach to clustering, clusters are defined as the local maxima of the underlying probability density function, where the latter can be estimated either nonparametrically or using finite mixture models. Thus, clusters are closely related to certain regions around the density modes, and every cluster corresponds to a bump of the density. The Modal Expectation‐Maximization (MEM) algorithm is an iterative procedure that can identify the local maxima of any density function. In this contribution, we propose a fast and efficient MEM algorithm to be used when the density function is estimated through a finite mixture of Gaussian distributions with parsimonious component‐covariance structures. After describing the procedure, we apply the proposed MEM algorithm on both simulated and real data examples, showing its high flexibility in several contexts.