Geodesic
New clusterization method based on graph connectivity search
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 10 (2017) no. 4, pp. 443-449

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{JSFU_2017_10_4_a4,
     author = {Michael G. Sadovsky and Eugene Yu. Bushmelev and Anatoly N. Ostylovsky},
     title = {New clusterization method based on graph connectivity search},
     journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika},
     pages = {443--449},
     publisher = {mathdoc},
     volume = {10},
     number = {4},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JSFU_2017_10_4_a4/}
}
TY  - JOUR
AU  - Michael G. Sadovsky
AU  - Eugene Yu. Bushmelev
AU  - Anatoly N. Ostylovsky
TI  - New clusterization method based on graph connectivity search
JO  - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
PY  - 2017
SP  - 443
EP  - 449
VL  - 10
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JSFU_2017_10_4_a4/
LA  - en
ID  - JSFU_2017_10_4_a4
ER  - 
%0 Journal Article
%A Michael G. Sadovsky
%A Eugene Yu. Bushmelev
%A Anatoly N. Ostylovsky
%T New clusterization method based on graph connectivity search
%J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
%D 2017
%P 443-449
%V 10
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JSFU_2017_10_4_a4/
%G en
%F JSFU_2017_10_4_a4
Michael G. Sadovsky; Eugene Yu. Bushmelev; Anatoly N. Ostylovsky. New clusterization method based on graph connectivity search. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 10 (2017) no. 4, pp. 443-449. http://geodesic.mathdoc.fr/item/JSFU_2017_10_4_a4/