Design of blurring mean-shift algorithms for data classification

DOI10.1007/S00357-016-9205-7zbMATH Open1349.62267OpenAlexW2495188021MaRDI QIDQ333342FDOQ333342

Authors: Carlo Grillenzoni 

Publication date: 28 October 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-016-9205-7

Recommendations

• On the convergence and consistency of the blurring mean-shift process
• Mean shift-based clustering
• Clustering methods based on kernel density estimators: mean shift algorithms
• Mean shift research and applications
• Mean shift spectral clustering

zbMATH Keywords

kernel densitybandwidth selectionimage segmentationnearest neighborsmonotone convergencecluster stabilitylocal means

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Density estimation (62G07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Cites Work

• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data-driven density derivative estimation, with applications to nonparametric clustering and bump hunting
• The estimation of the gradient of a density function, with applications in pattern recognition
• A note on the convergence of the mean shift
• On the convergence and consistency of the blurring mean-shift process
• PATTERN RECOGNITION VIA ROBUST SMOOTHING WITH APPLICATION TO LASER DATA
• Title not available (Why is that?)

Cited In (2)

• Mean shift-based clustering
• Title not available (Why is that?)

Uses Software

• Silhouettes
• CRAN
• KernSmooth
• ks

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)