Implementing bootstrap in ward´s algorithm to estimate the number of clusters
In this paper we show how bootstrap can be implemented in hierarchical clustering algorithms as a strategy to estimate the number of clusters (k). Ward´s algorithm was chosen as an example. The estimation of k is based on a similarity coefficient and three statistical stopping rules, pseudo F, pseud...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2009 |
| País: | Brasil |
| Institución: | Universidade Federal Fluminense (UFF) |
| Repositorio: | Sistemas & Gestão |
| Idioma: | portugués |
| OAI Identifier: | oai:ojs.www.revistasg.uff.br:article/65 |
| Acceso en línea: | https://www.revistasg.uff.br/sg/article/view/V4N2A1 |
| Access Level: | acceso abierto |
| Palabra clave: | Ward´s algorithm Estimation of number of clusters Bootstrap |
| Sumario: | In this paper we show how bootstrap can be implemented in hierarchical clustering algorithms as a strategy to estimate the number of clusters (k). Ward´s algorithm was chosen as an example. The estimation of k is based on a similarity coefficient and three statistical stopping rules, pseudo F, pseudo T2 and CCC. The performance of the estimation procedure was evaluated through Monte Carlo simulation considering data consisting of correlated and uncorrelated variables, nonoverlapping and overlapping clusters. The estimation procedure discussed in this paper can be used with clustering algorithms other than Ward´s and also to provide initial solutions for non-hierarchical grouping methods. |
|---|