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 ?
4 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
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 Commenti
Risposte (1)
Luciano Garim
il 5 Ott 2020
Use evalclusters. There are many ways to detect the right number of clusters using this function.
Type help evalclusters for more information.
0 Commenti
Vedere anche
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!