Combinations of the greedy heuristic method for clustering problems and local search algorithms

Описание

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: International Conference on Discrete Optimization and Operations Research, DOOR 2016; Vladivostok; Vladivostok

Год издания: 2016

Ключевые слова: clustering, genetic algorithm, Heuristic optimization, k-means, p-median, P-medoids

Аннотация: In this paper, we investigate application of various options of algorithms with greedy agglomerative heuristic procedure for object clustering problems in continuous space in combination with various local search methods. We propose new modifications of the greedy agglomerative heuristic algorithms with local search in SWAP neighboПоказать полностьюrhood for the p-medoid problems and j-means procedure for continuous clustering problems (p-median and k-means). New modifications of algorithms were applied to clustering problems in both continuous and discrete settings. Computational results with classical data sets and real data show the comparative efficiency of new algorithms for middle-size problems only.

Ссылки на полный текст

Издание

Журнал: CEUR Workshop Proceedings

Выпуск журнала: 1623

Номера страниц: 440-452

Авторы

Вхождение в базы данных