UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Methods for merging Gaussian mixture components

Hennig, C; (2010) Methods for merging Gaussian mixture components. Advances in Data Analysis and Classification , 4 (1) pp. 3-34. 10.1007/s11634-010-0058-3.

Full text not available from this repository.

Abstract

The problem of merging Gaussian mixture components is discussed in situations where a Gaussian mixture is fitted but the mixture components are not separated enough from each other to interpret them as "clusters". The problem of merging Gaussian mixtures is not statistically identifiable, therefore merging algorithms have to be based on subjective cluster concepts. Cluster concepts based on unimodality and misclassification probabilities ("patterns") are distinguished. Several different hierarchical merging methods are proposed for different cluster concepts, based on the ridgeline analysis of modality of Gaussian mixtures, the dip test, the Bhattacharyya dissimilarity, a direct estimator of misclassification and the strength of predicting pairwise cluster memberships. The methods are compared by a simulation study and application to two real datasets. A new visualisation method of the separation of Gaussian mixture components, the ordered posterior plot, is also introduced. © 2010 Springer-Verlag.

Type: Article
Title: Methods for merging Gaussian mixture components
DOI: 10.1007/s11634-010-0058-3
UCL classification: UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Maths and Physical Sciences
URI: http://discovery.ucl.ac.uk/id/eprint/148691
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item