Siberian Federal University 
- Issue
- Journal of Siberian Federal University. Mathematics & Physics. 2017 10 (4)
- Authors
- Sadovsky, Michael G.; Bushmelev, Eugene Yu.; Ostylovsky, Anatoly N.
- Contact information
- Sadovsky, Michael G.: Institute of computational modelling SB RAS Akademgorodok, 50/44, Krasnoyarsk, 660036 Russia; ; Bushmelev, Eugene Yu.: Institute of computational modelling SB RAS Akademgorodok, 50/44, Krasnoyarsk, 660036 Russia; ; Ostylovsky, Anatoly N.: Institute of Mathematics and Computer Science Siberian Federal University Svobodny, 79, Krasnoyarsk, 660041 Russia;
- Keywords
- order; complexity; clusterization; component; connectivity
- 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
- Pages
- 443–449
- Paper at repository of SibFU
- https://elib.sfu-kras.ru/handle/2311/34757
Journal of Siberian Federal University. Mathematics & Physics / New Clusterization Method Based on Graph Connectivity Search
Full text (.pdf)