Automatically finding clusters in normalized cuts

Abstract :

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.

Document type :
Journal articles
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal-imt.archives-ouvertes.fr/hal-00631620
Contributor : Admin Télécom Paristech <>
Submitted on : Wednesday, October 12, 2011 - 7:13:20 PM
Last modification on : Thursday, October 17, 2019 - 12:36:06 PM
Long-term archiving on : Tuesday, November 13, 2012 - 4:36:37 PM

File

clustering-PR2010.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

595

Files downloads

371