Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review
Randomized Algorithm of Finding the True Number of Clusters Based on Chebychev Polynomial Approximation. / Avros, R.; Granichin, O.; Shalymov, D.; Volkovich, Z.; Weber, G. -W.
DATA MINING: FOUNDATIONS AND INTELLIGENT PARADIGMS, VOL 1: CLUSTERING, ASSOCIATION AND CLASSIFICATION. ed. / DE Holmes; LC Jain. Springer Nature, 2012. p. 131-155 (Intelligent Systems Reference Library; Vol. 23).Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review
}
TY - CHAP
T1 - Randomized Algorithm of Finding the True Number of Clusters Based on Chebychev Polynomial Approximation
AU - Avros, R.
AU - Granichin, O.
AU - Shalymov, D.
AU - Volkovich, Z.
AU - Weber, G. -W.
PY - 2012
Y1 - 2012
N2 - One of the important problems arising in cluster analysis is the estimation of the appropriate number of clusters. In the case when the expected number of clusters is sufficiently large, the majority of the existing methods involve high complexity computations. This difficulty can be avoided by using a suitable confidence interval to estimate the number of clusters. Such a method is proposed in the current chapter.The main idea is to allocate the jump position of the within-cluster dispersion function using Chebyshev polynomial approximations. The confidence interval for the true number of clusters can be obtained in this way by means of a comparatively small number of the distortion calculations. a significant computational complexity decreasing is proven. Several examples are given to demonstrate the high ability of the proposed methodology.
AB - One of the important problems arising in cluster analysis is the estimation of the appropriate number of clusters. In the case when the expected number of clusters is sufficiently large, the majority of the existing methods involve high complexity computations. This difficulty can be avoided by using a suitable confidence interval to estimate the number of clusters. Such a method is proposed in the current chapter.The main idea is to allocate the jump position of the within-cluster dispersion function using Chebyshev polynomial approximations. The confidence interval for the true number of clusters can be obtained in this way by means of a comparatively small number of the distortion calculations. a significant computational complexity decreasing is proven. Several examples are given to demonstrate the high ability of the proposed methodology.
KW - Cluster analysis
KW - Clustering
KW - Cluster stability
KW - Randomized algorithms
KW - VALIDATION
KW - MODEL
KW - CONSISTENCY
KW - DENSITY
KW - TREE
M3 - глава/раздел
SN - 978-3-642-23165-0
T3 - Intelligent Systems Reference Library
SP - 131
EP - 155
BT - DATA MINING: FOUNDATIONS AND INTELLIGENT PARADIGMS, VOL 1: CLUSTERING, ASSOCIATION AND CLASSIFICATION
A2 - Holmes, DE
A2 - Jain, LC
PB - Springer Nature
ER -
ID: 4420519