A review of mean-shift algorithms for clustering

Abstract

A natural way to characterize the cluster structure of a dataset is by finding regions containing a high density of data. This can be done in a nonparametric way with a kernel density estimate, whose modes and hence clusters can be found using mean-shift algorithms. We describe the theory and practice behind clustering based on kernel density estimates and mean-shift algorithms. We discuss the blurring and non-blurring versions of mean-shift; theoretical results about mean-shift algorithms and Gaussian mixtures; relations with scale-space theory, spectral clustering and other algorithms; extensions to tracking, to manifold and graph data, and to manifold denoising; K-modes and Laplacian K-modes algorithms; acceleration strategies for large datasets; and applications to image segmentation, manifold denoising and multivalued regression.

28 pages, 9 figures. Invited book chapter to appear in the CRC Handbook of Cluster Analysis (eds. Roberto Rocci, Fionn Murtagh, Marina Meila and Christian Hennig)

References in corpus (1)

• The K-modes algorithm for clustering

Cited by in corpus (8)

• Kernel Smoothing, Mean Shift, and Their Learning Theory with Directional Data
• Efficient Power Theft Detection for Residential Consumers Using Mean Shift Data Mining Knowledge Discovery Process
• Skeleton Clustering: Dimension-Free Density-based Clustering
• The EM Perspective of Directional Mean Shift Algorithm
• Transductive Few-Shot Learning: Clustering is All You Need?
• Statistical Inference Using Mean Shift Denoising
• Comparison of Hand-held WEMI Target Detection Algorithms
• Mode and Ridge Estimation in Euclidean and Directional Product Spaces: A Mean Shift Approach