A tutorial on spectral clustering

By Ulrike von Luxburg. 2007

11,492 citations recorded by the source corpus.

Abstract In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. On the first glance spectral clustering appears slightly mysterious, and it is not obvious to see why it works at all and what it really does. The goal of this tutorial is to give some intuition on those questions. We describe different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.

Subfields: Artificial Intelligence, Geometry and Topology, Statistical and Nonlinear Physics, Graph Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yoshua Bengio
  2. Mohit Bansal
  3. Dacheng Tao
  4. Sergey Levine
  5. Jianfeng Gao
  6. Quoc V. Le
  7. Percy Liang
  8. Trevor Darrell

In Geometry and Topology

  1. Bernhard Schölkopf
  2. Michael M. Bronstein
  3. Huan Liu
  4. Pierre Vandergheynst
  5. René Vidal
  6. Santo Fortunato
  7. Jure Leskovec
  8. David Lopez-Paz

In Statistical and Nonlinear Physics

  1. Jure Leskovec
  2. Charu C. Aggarwal
  3. Huan Liu
  4. Stephan Günnemann
  5. Michael M. Bronstein
  6. William L. Hamilton
  7. Pierre Vandergheynst
  8. Jiliang Tang

In Graph Learning

  1. Jure Leskovec
  2. Stephan Günnemann
  3. Michael M. Bronstein
  4. William L. Hamilton
  5. Aleksandar Bojchevski
  6. Xavier Bresson
  7. Pierre Vandergheynst
  8. Joan Bruna

Citations in the corpus