|
This article is cited in 1 scientific paper (total in 1 paper)
Chain development
Yu. V. Malykhin, E. V. Shchepin Steklov Mathematical Institute of Russian Academy of Sciences, Moscow, Russia
Abstract:
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.
Received: March 15, 2015
Citation:
Yu. V. Malykhin, E. V. Shchepin, “Chain development”, Modern problems of mathematics, mechanics, and mathematical physics, Collected papers, Trudy Mat. Inst. Steklova, 290, MAIK Nauka/Interperiodica, Moscow, 2015, 317–322; Proc. Steklov Inst. Math., 290:1 (2015), 300–305
Linking options:
https://www.mathnet.ru/eng/tm3636https://doi.org/10.1134/S0371968515030267 https://www.mathnet.ru/eng/tm/v290/p317
|
|