Skip to Main content Skip to Navigation
Journal articles

Graph based k-means clustering

Abstract : An original approach to cluster multi-component data sets is proposed that includes an estimation of the number of clusters. Using Prim's algorithm to construct a minimal spanning tree (MST) we show that, under the assumption that the vertices are approximately distributed according to a spatial homogeneous Poisson process, the number of clusters can be accurately estimated by thresholding the sequence of edge lengths added to the MST by Prim's alorithm. This sequence, called the Prim tra jectory, contains sufficient information to determine both the number of clusters and the approximate locations of the cluster centroids. The estimated number of clusters and cluster centroids are used to initialize the generalized Lloyd algorithm, also known as k-means, which circumvents its well known initialization problems. We evaluate the false positive rate of our cluster detection algorithm, using Poisson approximations in Euclidean spaces. Applications of this method in the multi/hyper-spectral imagery domain to a satellite view of Paris and to an image of Mars are also presented.
Complete list of metadata

Cited literature [53 references]  Display  Hide  Download
Contributor : Pierre Comon <>
Submitted on : Wednesday, October 24, 2012 - 4:22:26 PM
Last modification on : Thursday, November 19, 2020 - 1:01:10 PM
Long-term archiving on: : Friday, January 25, 2013 - 3:50:12 AM


Files produced by the author(s)



Laurent Galluccio, Olivier Michel, Pierre Comon, Alfred Hero. Graph based k-means clustering. Signal Processing, Elsevier, 2012, 92 (9), pp.1970-1984. ⟨10.1016/j.sigpro.2011.12.009⟩. ⟨hal-00701886v2⟩



Record views


Files downloads