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 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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 commentaires
Réponses (1)
Luciano Garim
le 5 Oct 2020
Use evalclusters. There are many ways to detect the right number of clusters using this function.
Type help evalclusters for more information.
0 commentaires
Voir également
Catégories
En savoir plus sur Cluster Visualization and Evaluation dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!