Clustering methods based on kernel density estimators: mean shift algorithms
From MaRDI portal
Publication:4576281
Recommendations
Cited in
(22)- Bregman bubble clustering: a robust framework for mining dense clusters
- Mean shift-based clustering
- A unimodal clustering algorithm based on the \(k\)-nearest neighbors method
- A BRANCH AND BOUND ALGORITHM FOR FINDING THE MODES IN KERNEL DENSITY ESTIMATES
- Mean shift spectral clustering
- Generalized density attractor clustering for incomplete data
- scientific article; zbMATH DE number 7625193 (Why is no real title available?)
- A polynomial kernel based structural clustering algorithm by building directed trees
- Clustering by kernel density
- QuickDSC: clustering by quick density subgraph estimation
- CLUES: a non-parametric clustering method based on local shrinking
- A new algorithm for clustering based on kernel density estimation
- Gromov-Hausdorff limit of Wasserstein spaces on point clouds
- Mean shift research and applications
- Analysis of a mode clustering diagram
- MulticlusterKDE: a new algorithm for clustering based on multivariate kernel density estimation
- KDE paring and a faster mean shift algorithm
- scientific article; zbMATH DE number 2062636 (Why is no real title available?)
- A new measure for assessment of clustering based on kernel density estimation
- Design of blurring mean-shift algorithms for data classification
- 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
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)
