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!