k-means

Partitioning by centroids

K-means is a method for grouping data points into clusters based on their similarity.

The algorithm assigns each point to whichever cluster has the nearest center, then recalculates centers based on the new assignments, repeating until stable.

The k refers to the number of clusters, chosen in advance: We ran k-means with k=5 to segment customers into five groups.

A workhorse of machine learning and data analysis.

algorithm

clustering

Forming concentrated groups

Lloyd · assignment · partitioning · initialization · Euclidean · distance · optimization · unsupervised · classification · segmentation

application

segmentation

Division into sections

anomaly · detection · market · research · gene · expression · document · clustering · color · quantization

parameters

clusters

Grouped collections

initialization · seeds · restarts · threshold · hyperparameter · tuning · validation · selection · cross-validation

limitations

spherical

Globe-like in form

scaling · initialization · dependence · curse · imbalanced · sizes · density · varying · convergence · trapped

Categories
Opposites
learning paradigm

k-meansclassification

Systematic grouping by traits

regression · decision trees · neural networks

Family

mean, means, meaning, meant, meanly

Familiarity
Top 1,000,000
Profile
Used worldwide · Timeless · Abstract · Rated G