K-means clustering

Ever wondered how your favorite streaming service recommends shows?

Imagine you're trying to organize your bookshelf by genre, but you have books from multiple genres mixed together. You want to sort them into separate sections for easier access.

Think of k-means clustering like sorting your mixed books into neat piles based on their genre. Each pile represents a cluster of books that are similar in genre.

Example

You have 100 books, and you want to sort them into 5 genres. The algorithm groups them into 5 piles, each with books that are closely related in terms of genre.

Remember this

K-means clustering helps you organize data (like books) into groups (clusters) where each group is similar to the others.

Text adapted from Wikipedia, licensed under CC BY-SA 4.0.

Related concepts

Cross-validation (statistics)

Ever wonder how to test a recipe without knowing the final taste?

Mixture of experts

Mixture of experts (MoE) divides problem space into homogeneous regions

Matrix (mathematics)

Ever wondered how computers can predict your favorite songs?

B-trees optimize: disk-based sorted data with O(log n) reads per query

How can we quickly find your favorite song in a massive music library?

Random projection

Ever wondered how computers quickly understand vast amounts of text?

the Johnson-Lindenstrauss lemma says

Can we shrink big data without losing important details?

Swipe through more Machine Learning concepts

Open Pocket Polymath