next up previous
Next: Gibbs sampling Up: No Title Previous: Generalisations of k-means (2)

Generalisations of k-means (3)


k-means is a non-hierarchical clustering algorithm that requires the number of clusters (k) to be specified in advance.


figure=hierarchy.eps,width=1


Viewed as a mixture density estimation problem, however, it is possible to estimate the value of k from the data. See e.g. ``Markov Chain Monte Carlo in Practice'', Gilks et al.




2000-04-26