A global algorithm for clustering univariate observations
Paul Terre Fety
Abstract
This paper deals with the clustering of univariate observations: given a set of observations coming from K possible clusters, one has to estimate the cluster means. We propose an algorithm based on the minimization of the "KP" criterion we introduced in a previous work. In this paper, we show that the global minimum of this criterion can be reached by first solving a linear system then calculating the roots of some polynomial of order K. The KP global minimum provides a first raw estimate of the cluster means, and a final clustering step enables to recover the cluster means. Our method's relevance and superiority to the Expectation-Maximization algorithm is illustrated through simulations of various Gaussian mixtures. unsupervised clustering non-iterative algorithm optimization criterion univariate observations
Create a lesson
Related papers
Multi-fidelity Monte Carlo estimation of floor response spectra under combined seismic and structural parameter uncertainties
Nils Baillie, Baptiste Kerleguer, Cyril Feau et al.
Parameter inference from a non-stationary unknown process using statistical feature-based slow feature analysis
Kieran S. Owens, Masako Tamaki, Ben D. Fulcher
A Probability Model for Pentagonal Prism Dice Rolls
Paul R. Hurst, J. Naleo Hyde
Geometry-native machine learning reconstruction of DSMC moment fields with support monitoring
Ehsan Roohi
Multivariate amplitude analysis of the cascade particle decays based on the Nearest Neighbors fitting
I. V. Yeletskikh, A. O. Vasyukov
The geometry of uncertainty decomposition in profile-likelihood fits
Rafael Coelho Lopes de Sá