Geodesic
Chain development
Informatics and Automation, Modern problems of mathematics, mechanics, and mathematical physics, Tome 290 (2015), pp. 317-322

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

In a finite set $X$ with distance, we introduce a so-called chain distance. This distance generates a partition of $X$ into clusters such that any point inside each cluster can be connected with any other point of the same cluster by a chain whose every link does not exceed a given threshold value. We construct a chain development, by which we mean a mapping of $X$ into a straight line that preserves the chain distance and allows one to rapidly perform clustering. We also present an efficient algorithm for constructing a chain development. 
@article{TRSPY_2015_290_a25,
     author = {Yu. V. Malykhin and E. V. Shchepin},
     title = {Chain development},
     journal = {Informatics and Automation},
     pages = {317--322},
     publisher = {mathdoc},
     volume = {290},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a25/}
}
TY  - JOUR
AU  - Yu. V. Malykhin
AU  - E. V. Shchepin
TI  - Chain development
JO  - Informatics and Automation
PY  - 2015
SP  - 317
EP  - 322
VL  - 290
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a25/
LA  - ru
ID  - TRSPY_2015_290_a25
ER  - 
%0 Journal Article
%A Yu. V. Malykhin
%A E. V. Shchepin
%T Chain development
%J Informatics and Automation
%D 2015
%P 317-322
%V 290
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a25/
%G ru
%F TRSPY_2015_290_a25
Yu. V. Malykhin; E. V. Shchepin. Chain development. Informatics and Automation, Modern problems of mathematics, mechanics, and mathematical physics, Tome 290 (2015), pp. 317-322. http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a25/