Шукати за:
Роком видання
Автором
Назвою статті
Modification of Algorithm for Graph Construction in the Chameleon Algorithm
Повний текст (PDF)
УДК: 539.3
Мова публікації: Російська
Stuc. intelekt. 2012; 17; (3):480-486
Анотація: In the article, modification of Chameleon algorithm is presented. Chameleon algorithm consists of the following stages: graph construction, coarsening, partitioning and uncoarsening. At each of these steps, different algorithms and approaches can be used. The main goal of this work is investigation and improvement of graph construction stage. This can be done by modification of k-selection algorithm during k-nn graph construction. It is considered two kinds of graphs: symmetric and asymmetric.
Ключові слова: clustering, Chameleon algorithm, graph construction, connectivity, k-nearest neighbors
Посилання:
Переглянути повний текст статті (PDF)