A global algorithm for clustering univariate observations

Details A global algorithm for clustering univariate observations A global algorithm for clustering univariate observations

2007-03-30

arxiv.org/abs/physics/0703281v1

Physics

Data Analysis, Statistics and Probability

Scientific paper

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. \keywords{unsupervised clustering \and non-iterative algorithm \and optimization criterion \and univariate observations

Affiliated with

Also associated with

No associations

Rating

A global algorithm for clustering univariate observations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A global algorithm for clustering univariate observations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A global algorithm for clustering univariate observations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-651275