Amanote Research
Register
Sign In
Figure 6: (A) Behavior of Accuracy in Terms of Number of Clusters and (B) Confusion Matrix With Best Results (Clusters = 11) Using K-Means Algorithm.
doi 10.7717/peerj-cs.270/fig-6
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Unknown
Publisher
PeerJ
Related search
Distance Based K-Means Clustering Algorithm for Determining Number of Clusters for High Dimensional Data
Decision Science Letters
Decision Sciences
Figure 4: Bayesian Individual Assignment Implemented Using STRUCTURE for K = 2 Clusters (A), K = 3 Clusters (B) and K = 5 Clusters (C) Without Using Geographical Area as a Prior.
Figure S2: Plot of DIC Against the Number of K Clusters, and Tess Plots for K = 2 to K = 6
Estimating the Optimal Number of Clusters K in a Dataset Using Data Depth
Data Science and Engineering
Computational Mechanics
Computer Science Applications
Modification K-Means Model With Local Deviation Method to Improve the Accuracy in Forming Clusters
A New Clustering Algorithm Based on Regions of Influence With Self-Detection of the Best Number of Clusters
Intelligent Choice of the Number of Clusters in K-Means Clustering: An Experimental Study With Different Cluster Spreads
Journal of Classification
Statistics
Psychology
Probability
Information Sciences
Uncertainty
Library
Mathematics
Discovering Local Outliers Using Dynamic Minimum Spanning Tree With Self-Detection of Best Number of Clusters
International Journal of Computer Applications
Cross-Clustering: A Partial Clustering Algorithm With Automatic Estimation of the Number of Clusters
PLoS ONE
Multidisciplinary
