Nuevas técnicas de particionamiento en clasificación automática
שמור ב:
| Autores: | , , |
|---|---|
| פורמט: | artículo original |
| סטטוס: | Versión publicada |
| Fecha de Publicación: | 1999 |
| תיאור: | In this article there are exposed some new thechniques for hte search of global optima inthe partitioning problem in Cluster Analysis. With these thechniques the results are sensibly improved with respect to the traditional methods. The methods developed here are well known in Combinatorial Optimization: i) simulated annealing; ii) tabu search, iii) genetic algorithms. We use these three approaches in the partitioning problem for clustering, following a search xhee similar to that of Regnier's algorithm of transfers. |
| País: | Portal de Revistas UCR |
| מוסד: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| שפה: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/168 |
| גישה מקוונת: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/168 |
| Access Level: | acceso abierto |
| מילת מפתח: | Clustering stochastic optimization combinatorial optimization heuristics Clasificación optimización estocástica optimización combinatoria heurística |