Võrdle meetodeid

	Calinski-Harabasz Indeks	Dunn Index	Lõhe statistika	Inertsus
Valdkond	Mudelite hindamine	Mudelite hindamine	Mudelite hindamine	Mudelite hindamine
Perekond	MCDM	MCDM	MCDM	MCDM
Tekkeaasta	1974	1974	2001	1967
Looja	Tadeusz Calinski, Jerzy Harabasz	Joseph C. Dunn	Robert Tibshirani, Guenther Walther, Trevor Hastie	Stuart Lloyd, James MacQueen
Tüüp	Cluster quality metric	Cluster quality metric	Statistical criterion	Clustering quality metric
Algallikas	Calinski, T., & Harabasz, J. (1974). A dendrite method for cluster analysis. Communications in Statistics, 3(1), 1-27.	Dunn, J. C. (1974). Well-separated clusters and optimal fuzzy partitions. Journal of Cybernetics, 4(1), 95-104.	Tibshirani, R., Walther, G., & Hastie, T. (2001). Estimating the number of clusters in a data set via the gap statistic. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 63(2), 411-423.	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129-137.
Rööpnimetused	variance ratio criterion, pseudo F-statistic, CH index	Dunn's index, separation coefficient	gap index, Tibshirani gap statistic	WCSS, within-cluster sum of squares, cluster cohesion
Seotud	5	5	5	5
Kokkuvõte	The Calinski-Harabasz Index, also called the Variance Ratio Criterion, was introduced by Calinski and Harabasz in 1974. It is a metric that measures the ratio of between-cluster variance to within-cluster variance, adjusted for the number of clusters and data points. Higher values indicate better-separated, more compact clusters.	The Dunn Index, introduced by Joseph C. Dunn in 1974, is a metric that captures cluster quality by measuring the ratio of the minimum between-cluster distance to the maximum within-cluster diameter. Higher values indicate well-separated and compact clusters, with better clustering quality.	The Gap Statistic, developed by Tibshirani, Walther, and Hastie in 2001, is a principled statistical method for determining the optimal number of clusters in a dataset. It compares the observed within-cluster sum of squares to the expected value under a null hypothesis of no clustering structure, providing a theoretically grounded approach to cluster number selection.	Inertia, also called Within-Cluster Sum of Squares (WCSS), is a measure of cluster cohesion that quantifies how tightly points are grouped around their cluster centroids. Lower values indicate more compact, cohesive clusters. Inertia is the primary objective function for k-means clustering and has been a fundamental metric since the method's introduction.