Método heurístico para particionamiento óptimo
Many data analysis problems deal with non supervised partitioning of a data set, in non empty clusters well separated between them and homogeneous within the clusters. An ideal partitioning is obtained when any object can be assigned a class without ambiguity. The present paper has two main parts; f...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Universidad de Costa Rica
2009-02-01
|
Series: | Revista de Matemática: Teoría y Aplicaciones |
Online Access: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/221 |