Clustering methods based on kernel density estimators: mean shift algorithms
From MaRDI portal
Publication:4576281
zbMATH Open1396.62124MaRDI QIDQ4576281FDOQ4576281
Authors: Miguel Á. Carreira-Perpiñán 
Publication date: 12 July 2018
Recommendations
Density estimation (62G07) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Cited In (22)
- A new measure for assessment of clustering based on kernel density estimation
- Bregman bubble clustering: a robust framework for mining dense clusters
- Mean shift-based clustering
- A BRANCH AND BOUND ALGORITHM FOR FINDING THE MODES IN KERNEL DENSITY ESTIMATES
- MulticlusterKDE: a new algorithm for clustering based on multivariate kernel density estimation
- QuickDSC: clustering by quick density subgraph estimation
- Mean shift research and applications
- A polynomial kernel based structural clustering algorithm by building directed trees
- Design of blurring mean-shift algorithms for data classification
- A unimodal clustering algorithm based on the \(k\)-nearest neighbors method
- Gromov-Hausdorff limit of Wasserstein spaces on point clouds
- A new algorithm for clustering based on kernel density estimation
- Mean shift spectral clustering
- Title not available (Why is that?)
- Generalized density attractor clustering for incomplete data
- CLUES: a non-parametric clustering method based on local shrinking
- KDE paring and a faster mean shift algorithm
- Clustering Dynamics on Graphs: From Spectral Clustering to Mean Shift Through Fokker–Planck Interpolation
- On the estimation of the gradient lines of a density and the consistency of the mean-shift algorithm
- Clustering by kernel density
- Title not available (Why is that?)
- Analysis of a mode clustering diagram
This page was built for publication: Clustering methods based on kernel density estimators: mean shift algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576281)
