ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

慣性×Calinski-Harabasz Index(キャリンスキー・ハラバス指数)×Dunn Index×エルボー法×
分野モデル評価モデル評価モデル評価モデル評価
系統MCDMMCDMMCDMMCDM
提唱年1967197419741953
提唱者Stuart Lloyd, James MacQueenTadeusz Calinski, Jerzy HarabaszJoseph C. DunnRobert Thorndike
種類Clustering quality metricCluster quality metricCluster quality metricHeuristic optimization criterion
原典Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129-137. DOI ↗Calinski, T., & Harabasz, J. (1974). A dendrite method for cluster analysis. Communications in Statistics, 3(1), 1-27. DOI ↗Dunn, J. C. (1974). Well-separated clusters and optimal fuzzy partitions. Journal of Cybernetics, 4(1), 95-104. DOI ↗Hastie, T., Tibshirani, R., & Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer Series in Statistics. link ↗
別名WCSS, within-cluster sum of squares, cluster cohesionvariance ratio criterion, pseudo F-statistic, CH indexDunn's index, separation coefficientelbow analysis, knee detection
関連5555
概要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.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 Elbow Method is a heuristic for selecting the optimal number of clusters in partitional clustering. Introduced by Robert Thorndike in 1953, it involves fitting clustering models for increasing numbers of clusters and plotting the within-cluster sum of squares (WCSS) against the number of clusters. The 'elbow' occurs where the rate of WCSS decrease sharply changes, suggesting an optimal cluster count.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Inertia (Within-Cluster Sum of Squares) · Calinski-Harabasz Index · Dunn Index · Elbow Method. 2026-06-20に以下より取得 https://scholargate.app/ja/compare