Description
K-means algorithm identifies k number of centroids, and then allocates every data point to the nearest cluster, while keeping the centroids as small as possible.
Technical Details
| Framework | MITRE D3FEND |
| Ontology URI | d3f:K-meansClustering |
| Local Identifier | K-meansClustering |
| Publication Status | Exists in ontology only |