Share This

“One of the two main algorithms to identify clusters in data. Expectation maximization is the other. The algorithm begins with a target of identify K-clusters. The goal is to find the best way to split the data to assign each point to a single cluster. In raw form, the process compares each point to the K clusters computing the distance to minimize the variance within each cluster. It can be a slow algorithm for large data sets.”

« Back to Glossary Index Download Tooltip Pro
By |February 1st, 2019|Comments Off on K-means