Search by:
Year of publication
Author name
Paper title
Modification of Algorithm for Graph Construction in the Chameleon Algorithm
Full text (PDF)
UDC: 539.3
Publication Language: Russian
Stuc. intelekt. 2012; 17(3):480-486
Abstract: 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.
Keywords: clustering, Chameleon algorithm, graph construction, connectivity, k-nearest neighbors
References:
View full text (PDF)