Finding reproducible cluster partitions for the k-means algorithm

K-means clustering is widely used for exploratory data analysis. While its dependence on initialisation is well-known, it is common practice to assume that the partition with lowest sum-of-squares (SSQ) total i.e. within cluster variance, is both reproducible under repeated initialisations and also...

Descripción completa

Detalles Bibliográficos
Autores principales: Lisboa, Paulo JG, Etchells, Terence A, Jarman, Ian H, Chambers, Simon J
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2013
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3548705/
https://www.ncbi.nlm.nih.gov/pubmed/23369085
http://dx.doi.org/10.1186/1471-2105-14-S1-S8

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3548705/
https://www.ncbi.nlm.nih.gov/pubmed/23369085
http://dx.doi.org/10.1186/1471-2105-14-S1-S8

Ejemplares similares