Geodesic
On metric clustering
Diskretnaya Matematika, Tome 8 (1996) no. 4, pp. 62-78 
A. A. Bolotov. On metric clustering. Diskretnaya Matematika, Tome 8 (1996) no. 4, pp. 62-78. http://geodesic.mathdoc.fr/item/DM_1996_8_4_a5/
@article{DM_1996_8_4_a5,
     author = {A. A. Bolotov},
     title = {On metric clustering},
     journal = {Diskretnaya Matematika},
     pages = {62--78},
     year = {1996},
     volume = {8},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1996_8_4_a5/}
}
TY  - JOUR
AU  - A. A. Bolotov
TI  - On metric clustering
JO  - Diskretnaya Matematika
PY  - 1996
SP  - 62
EP  - 78
VL  - 8
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/DM_1996_8_4_a5/
LA  - ru
ID  - DM_1996_8_4_a5
ER  - 
%0 Journal Article
%A A. A. Bolotov
%T On metric clustering
%J Diskretnaya Matematika
%D 1996
%P 62-78
%V 8
%N 4
%U http://geodesic.mathdoc.fr/item/DM_1996_8_4_a5/
%G ru
%F DM_1996_8_4_a5

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

Using the combinatorial-logical approach, we consider the problem of clustering a set of vectors from an $n$-dimensional vector space of attributes. The main results of the paper are the study of the optimal partitions into clusters with respect to some functionals and the design of iterative and gradient algorithms of clustering based on this consideration. It is shown that all optimal partitions are well-separable with respect to the corresponding decision rules.