Design of blurring mean-shift algorithms for data classification
From MaRDI portal
Publication:333342
Recommendations
Cites work
- scientific article; zbMATH DE number 3519671 (Why is no real title available?)
- scientific article; zbMATH DE number 469135 (Why is no real title available?)
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- A note on the convergence of the mean shift
- Data-driven density derivative estimation, with applications to nonparametric clustering and bump hunting
- On the convergence and consistency of the blurring mean-shift process
- PATTERN RECOGNITION VIA ROBUST SMOOTHING WITH APPLICATION TO LASER DATA
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- The estimation of the gradient of a density function, with applications in pattern recognition
Cited in
(7)- Mean shift-based clustering
- On the convergence and consistency of the blurring mean-shift process
- The mean shift algorithm and its relation to kernel regression
- scientific article; zbMATH DE number 2044061 (Why is no real title available?)
- On the strengths of the self-updating process clustering algorithm
- Clustering methods based on kernel density estimators: mean shift algorithms
- Bayesian interpretation to generalize adaptive mean shift algorithm
This page was built for publication: Design of blurring mean-shift algorithms for data classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333342)