Método heurístico para particionamiento óptimo
সংরক্ষণ করুন:
| লেখক: | , , , |
|---|---|
| বিন্যাস: | artículo original |
| বর্তমান অবস্থা: | Versión publicada |
| প্রকাশনার তারিখ: | 2003 |
| বিবরন: | 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; first, we present different methods and heuristics that find the number of clusters for optimal partitioning of a set; afterwards, we propose a new heuristic and we perform different comparisons in order to evaluate the advantages on well known data sets; we end the paper with some concluding remarks. |
| দেশ: | Portal de Revistas UCR |
| প্রতিষ্ঠান: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| ভাষা: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/221 |
| অনলাইন ব্যবহার করুন: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/221 |
| মুখ্য শব্দ: | Optimal partitioning clustering classification heuristics Particionamiento óptimo clasificación heurísticas |