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 ?
3 ビュー (過去 30 日間)
古いコメントを表示
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
0 件のコメント
回答 (1 件)
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.
0 件のコメント
参考
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!