Sign inSign in
ConceptMathematics

Spectral clustering

A machine learning method that involves computing eigen functions of the graph Laplacian to group data.
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

2

Each in their own terms, from the easiest level.

  • Gilbert Strang

    MIT · Undergraduate

    A clustering technique that uses the eigenvalues of a matrix, specifically the graph Laplacian, to perform dimensionality reduction and group data.
    • 12:38Finding Clusters in Graphs

Lectures that assume it

1

Connections

9

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

2 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.