|
This article is cited in 1 scientific paper (total in 1 paper)
New clusterization method based on graph connectivity search
Michael G. Sadovskya, Eugene Yu. Bushmeleva, Anatoly N. Ostylovskyb a 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.
Received: 10.01.2017 Received in revised form: 30.03.2017 Accepted: 05.06.2017
Citation:
Michael G. Sadovsky, Eugene Yu. Bushmelev, Anatoly N. Ostylovsky, “New clusterization method based on graph connectivity search”, J. Sib. Fed. Univ. Math. Phys., 10:4 (2017), 443–449
Linking options:
https://www.mathnet.ru/eng/jsfu573 https://www.mathnet.ru/eng/jsfu/v10/i4/p443
|
Statistics & downloads: |
Abstract page: | 157 | Full-text PDF : | 71 | References: | 36 |
|