|
This article is cited in 2 scientific papers (total in 2 papers)
On a robust approach to search for cluster centers
Z. M. Shibzukhovab a Institute of Mathematics and Computer Science, Moscow Pedagogical
State University, Moscow, 119991 Russia
b Moscow Institute of Physics and Technology, Dolgoprudnyi, Moscow oblast, 141701 Russia
Abstract:
We propose a new approach to the construction of $k$-means clustering algorithms in which the Mahalanobis distance is used instead of the Euclidean distance. The approach is based on minimizing differentiable estimates of the mean insensitive to outliers. Illustrative examples convincingly show that the proposed algorithm is highly likely to be robust with respect to a large amount of outliers in the data.
Keywords:
cluster center, robust mean, Mahalanobis distance, iterative reweighting, robust algorithm.
Citation:
Z. M. Shibzukhov, “On a robust approach to search for cluster centers”, Avtomat. i Telemekh., 2021, no. 10, 140–151; Autom. Remote Control, 82:10 (2021), 1742–1751
Linking options:
https://www.mathnet.ru/eng/at15804 https://www.mathnet.ru/eng/at/y2021/i10/p140
|
Statistics & downloads: |
Abstract page: | 103 | Full-text PDF : | 3 | References: | 27 | First page: | 17 |
|