This article is cited in 1 paper

New clusterization method based on graph connectivity search

Michael G. Sadovsky^a, Eugene Yu. Bushmelev^a, Anatoly N. Ostylovsky<sup>b

a</sup> Institute of computational modelling SB RAS, Akademgorodok, 50/44, Krasnoyarsk, 660036, Russia
^b Institute of Mathematics and Computer Science, Siberian Federal University, Svobodny, 79, Krasnoyarsk, 660041, Russia

Abstract: New method is proposed to identify clusters in datasets. The method is based on a sequential elimination of the longest distances in dataset, so that the relevant graph looses some edges. The method stops when the graph becomes disconnected.

Keywords: order, complexity, clusterization, component, connectivity.

UDC: 57:015 + 573.2

Received: 10.01.2017
Received in revised form: 30.03.2017
Accepted: 05.06.2017

Language: English

DOI: 10.17516/1997-1397-2017-10-4-443-449

Bibliographic databases:

•