Automatically finding clusters in normalized cuts - IMT - Institut Mines-Télécom Access content directly
Journal Articles Pattern Recognition Year : 2011

Automatically finding clusters in normalized cuts


Normalized Cuts is a state-of-the-art spectral method for clustering. By applying spectral techniques, the data becomes easier to cluster and then k-means is classically used. Unfortunately the number of clusters must be manually set and it is very sensitive to initialization. Moreover, k-means tends to split large clusters, to merge small clusters, and to favor convex-shaped clusters. In this work we present a new clustering method which is parameterless, independent from the original data dimensionality and from the shape of the clusters. It only takes into account inter-point distances and it has no random steps. The combination of the proposed method with normalized cuts proved successful in our experiments.
Fichier principal
Vignette du fichier
clustering-PR2010.pdf (3.4 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00631620 , version 1 (12-10-2011)



Mariano Tepper, Pablo Musé, A. Almansa, Marta Mejail. Automatically finding clusters in normalized cuts. Pattern Recognition, 2011, 44 (7), pp.1372-1386. ⟨10.1016/j.patcog.2011.01.003⟩. ⟨hal-00631620⟩
423 View
577 Download



Gmail Facebook X LinkedIn More