Which is the best (fastest) algorithm for finding no of clusters for k means while clustering a multi-spectral image, Silhouette value , or Dunn Index or Davies Bouldin index ?

2 次查看（过去 30 天）
kumud alok
kumud alok 2016-5-10
回答： Luciano Garim 2020-10-5
I am using Silhouette value for cluster cohesion evaluation, but finding silhouette for all possible no of clusters makes it slow, so i rather want to find the optimum no of clusters first that exists in the data and then use the silhouette value for further cluster compactness evaluation

请先登录，再回答此问题。

回答（1 个）

Luciano Garim
Luciano Garim 2020-10-5
Use evalclusters. There are many ways to detect the right number of clusters using this function.
Type help evalclusters for more information.

类别

在 Help Center 和 File Exchange 中查找有关 Cluster Analysis and Anomaly Detection 的更多信息

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by