O'Reilly logo

Data Clustering by Chandan K. Reddy, Charu C. Aggarwal

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

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

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required