Chapter 8

Spectral Clustering

Jialu Liu

University of Illinois at Urbana-ChampaignUrbana, ILjliu64@illinois.edu

Jiawei Han

University of Illinois at Urbana-ChampaignUrbana, ILhanj@illinois.edu

8.1 Introduction

In this chapter, we introduce the family of spectral clustering algorithms which have seen increasing popularity over the past few years. Starting with the seminal works in [37] and [43], a large number of papers has been published along this line of work. As opposed to “traditional clustering algorithms” such as k-means and generative mixture models which always result in clusters with convex geometric shape, spectral clustering can solve problems in much more complex scenarios, such as intertwined spirals, or other arbitrary nonlinear ...

Get Data Clustering now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.