Centroid movement and transferences: alternatives for generating neighbors in simulated annealing
সংরক্ষণ করুন:
| লেখক: | , |
|---|---|
| বিন্যাস: | artículo original |
| বর্তমান অবস্থা: | Versión publicada |
| প্রকাশনার তারিখ: | 2016 |
| বিবরন: | In this paper, two different strategies to generate neighbors in the simulated annealing algorithm were compared. The first idea is based on transferring objects between classes. The other strategy moves artificial objects (called centroids) which represent the clusters. A comparison was developed using the combinatorial optimization problem of quantitative data clustering. This problem is presented as the minimization of W(P), which represents the within-inertia as a function of the partition P. Finally, this allowed comparison of the algorithms’ performance in several data sets. |
| দেশ: | Portal de Revistas TEC |
| প্রতিষ্ঠান: | Instituto Tecnológico de Costa Rica |
| Repositorio: | Portal de Revistas TEC |
| ভাষা: | Español |
| OAI Identifier: | oai:ojs.pkp.sfu.ca:article/2586 |
| অনলাইন ব্যবহার করুন: | https://revistas.tec.ac.cr/index.php/tec_marcha/article/view/2586 |
| মুখ্য শব্দ: | Heurísticas optimización sobrecalentamiento simulado particionamiento de datos Heuristics optimization simulated annealing data clustering |