Consistent Minimization of Clustering Objective Functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Consistent Minimization of Clustering Objective Functions


Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure. However, in the statistical setting where we assume that the finite data set has been sampled from some underlying space, the goal is not to find the best partition of the given sample, but to approximate the true partition of the underlying space. We argue that the discrete optimization approach usually does not achieve this goal. As an alternative, we suggest the paradigm of ``nearest neighbor clustering''. Instead of selecting the best out of all partitions of the sample, it only considers partitions in some restricted function class. Using tools from statistical learning theory we prove that nearest neighbor clustering is statistically consistent. Moreover, its worst case complexity is polynomial by construction, and it can be implemented with small average case complexity using branch and bound.
Fichier principal
Vignette du fichier
LuxburgBubeckJegelka_nips07.pdf (153.7 Ko) Télécharger le fichier
LuxburgBubeckJegelka_nips07_supplement.pdf (235.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other

Dates and versions

inria-00185777 , version 1 (07-11-2007)


  • HAL Id : inria-00185777 , version 1


Ulrike von Luxburg, Sébastien Bubeck, Stefanie Jegelka, Michael Kaufmann. Consistent Minimization of Clustering Objective Functions. Neural Information Processing Systems, Dec 2007, Vancouver, Canada. ⟨inria-00185777⟩
167 View
280 Download


Gmail Facebook X LinkedIn More