Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: International Conference on Information Technologies, InfoTech 2020; Varna; Varna
Год издания: 2020
Идентификатор DOI: 10.1109/InfoTech49733.2020.9211070
Ключевые слова: clustering genetic algorithm, greedy agglomerative heuristic, k-means, p-median
Аннотация: In this paper, we propose new algorithms for solving the classical problem of cluster analysis, k-Means, which uses the variable neighborhoods search in randomized neighborhoods formed by running the greedy agglomerative procedures. A comparison with known algorithms including the algorithms with greedy heuristics is given, and theПоказать полностьюadvantage is confirmed experimentally. © 2020 IEEE.
Журнал: 2020 34th International Conference on Information Technologies, InfoTech 2020 - Proceedings
Номера страниц: 9211070
Издатель: 34th International Conference on Information Technologies, InfoTech 2020