DeepAI AI Chat
Log In Sign Up

Space Partitioning and Regression Mode Seeking via a Mean-Shift-Inspired Algorithm

by   Wanli Qiao, et al.

The mean shift (MS) algorithm is a nonparametric method used to cluster sample points and find the local modes of kernel density estimates, using an idea based on iterative gradient ascent. In this paper we develop a mean-shift-inspired algorithm to estimate the modes of regression functions and partition the sample points in the input space. We prove convergence of the sequences generated by the algorithm and derive the non-asymptotic rates of convergence of the estimated local modes for the underlying regression model. We also demonstrate the utility of the algorithm for data-enabled discovery through an application on biomolecular structure data. An extension to subspace constrained mean shift (SCMS) algorithm used to extract ridges of regression functions is briefly discussed.


page 1

page 2

page 3

page 4


The functional mean-shift algorithm for mode hunting and clustering in infinite dimensions

We introduce the functional mean-shift algorithm, an iterative algorithm...

On the Convergence of the Mean Shift Algorithm in the One-Dimensional Space

The mean shift algorithm is a non-parametric and iterative technique tha...

A review of mean-shift algorithms for clustering

A natural way to characterize the cluster structure of a dataset is by f...

On Convergence of Epanechnikov Mean Shift

Epanechnikov Mean Shift is a simple yet empirically very effective algor...

Kernel Smoothing, Mean Shift, and Their Learning Theory with Directional Data

Directional data consist of observations distributed on a (hyper)sphere,...

Finding Modes by Probabilistic Hypergraphs Shifting

In this paper, we develop a novel paradigm, namely hypergraph shift, to ...

Scalable Laplacian K-modes

We advocate Laplacian K-modes for joint clustering and density mode find...