An efficient k-means clustering algorithm: analysis and implementation
Article
Article
In k-means clustering, we are given a set of n data points in d-dimensional space R/sup d/ and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared dist...
Idioma English
Página del recurso disponiblePágina de referencia del recurso. El texto completo no está confirmado automáticamente.
Página del recurso