Optimal Time Bounds for Approximate Clustering.

Optimal Time Bounds for Approximate Clustering.

Detalhes bibliográficos
Publicado no:Machine learning. 56, 1-3 (2004).
Autor principal: Mettu, Ramgopal R.
Formato: Artigo
Idioma:English
Assuntos:
K-means.
K-median.
Unsupervised clustering.
Approximation algorithms.
Discrete location theory.