Building the connectivity graph in the algorithm of clustering the compex objects

Authors

  • Tetiana Borysivna Shatovska Kharkov National University of Radio Electronics
  • Iryna Vitaliivna Kamenieva Kharkov National University of Radio Electronics

Keywords:

clustering, Chameleon algorithm, graph construction, connectivity, k-nearest neighbors

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.

Author Biographies

Tetiana Borysivna Shatovska, Kharkov National University of Radio Electronics

Ph.D. Associate Professor of Software Engineering

Iryna Vitaliivna Kamenieva, Kharkov National University of Radio Electronics

Ph.D. Senior Lecturer, Department of Software Engineering

Downloads

Abstract views: 252

How to Cite

[1]
T. B. Shatovska and I. V. Kamenieva, “Building the connectivity graph in the algorithm of clustering the compex objects”, ІТКІ, vol. 29, no. 1, Jun. 2014.

Issue

Vol. 29 No. 1 (2014): Information Technology and Computer Engineering

Section

Mathematical modeling and computational methods

Metrics

Downloads

Download data is not yet available.