Sign inSign in
ConceptAI & ML

K-means clustering

An algorithm for clustering data by repeatedly assigning points to clusters and updating the centers of those clusters.
as Brian Yu defines itHarvard UniversityThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Yaser Abu-Mostafa

    Caltech · Undergraduate

    An algorithm where the center for data points ends up being the mean of the cluster.
    • 29:53Radial Basis Functions
  • Gilbert Strang

    MIT · Undergraduate

    An iterative algorithm that partitions points into k clusters by alternating between finding cluster centroids and assigning each point to the closest centroid.
    • 10:00Finding Clusters in Graphs
  • Percy Liang

    Stanford University · Research

    An unsupervised learning algorithm that partitions data into K distinct clusters based on their features.
    • 44:55Marin: An Open Lab For Frontier AI

Lectures that assume it

2

Connections

15

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.