AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

On the Consistency of Quick Shift

NeurIPS 2017 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 7 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Quick Shift with τ < r_M/2 and the stated bandwidth conditionsQuick Shift · Density mode recoveryHausdorff distance: d(\mathcal{M}, \widehat{\mathcal{M}}) = \tilde{O}(n^{-1/(4+d)})Helped
Tune τ to merge modes that are not maximal in their τ-radius neighborhoodQuick Shift · Density mode recovery with segmentationMode recovery guarantee: ||x_0 - \hat{x} ||^2 < C\left((\log n)^{4/\rho} h^{2} + \sqrt{\frac{\log n}{n \cdot h^d}}\right)Mixed
Use Quick Shift edges with τ < r_s/2Quick Shift · Density cluster assignmentsSeparation of assigned clustersHelped
Build level-set components from Quick Shift and link nearby componentsQuick Shift Cluster Tree Estimator · Density cluster treeMerge distortion consistencyHelped
Apply Quick Shift to estimate conditional-density modesQuick Shift Modal Regression · Conditional density modesHausdorff distance: d_H(\mathcal{M}_x, \widehat{\mathcal{M}}_x) \rightarrow 0 \text{ as } n\rightarrow \inftyHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy