On the Consistency of Quick Shift
classification
📊 stat.ML
cs.LG
keywords
quickshiftalgorithmconsistencyapplyassumptionsclusterclustering
read the original abstract
Quick Shift is a popular mode-seeking and clustering algorithm. We present finite sample statistical consistency guarantees for Quick Shift on mode and cluster recovery under mild distributional assumptions. We then apply our results to construct a consistent modal regression algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.