Received 24.12.2013, Revised 06.03.2014, Accepted 07.04.2014

Construction of the connectivity graph in the clustering algorithm of complex objects

Tetiana Shatovska, Iryna Kameneva

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
83-89
Shatovska, T., & Kameneva, I. (2014). Construction of the connectivity graph in the clustering algorithm of complex objects. Information Technologies and Computer Engineering, 11(1), 83-89.

References

References in the process of publication