Jump to content

K-means clustering

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 220.62.64.75 (talk) at 08:14, 7 August 2005 (== External links ==). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The k-means algorithm is a variant of the Expectation-Maximization algorithm in which the goal is to determine the k means of data generated from Gaussian distributions. k-means is an algorithm to cluster objects based on attributes into K number of partitions.

Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Stub icon

This computing article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=K-means_clustering&oldid=20463571"