Robust mean-shift clustering based on impartial trimming
From MaRDI portal
Cites work
- A fast algorithm for robust constrained clustering
- A general trimming approach to robust cluster analysis
- A population background for nonparametric density-based clustering
- A Review on Modal Clustering
- A reweighting approach to robust clustering
- A robust method for cluster analysis
- An adequacy approach for deciding the number of clusters for OTRIMLE robust Gaussian mixture‐based clustering
- An impartial trimming approach for joint dimension and sample reduction
- An introduction to Morse theory. Transl. from the Japanese by Kiki Hudson and Masahico Saito
- Consistency, breakdown robustness, and algorithms for robust improper maximum likelihood clustering
- Constrained parsimonious model-based clustering
- Dissolution point and isolation robustness: Robustness criteria for general cluster analysis methods
- Finding the Number of Normal Groups in Model-Based Clustering via Constrained Likelihoods
- Generalized density clustering
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 1082208 (Why is no real title available?)
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- Kernel smoothing, mean shift, and their learning theory with directional data
- Locating \(\gamma\)-ray sources on the celestial sphere via modal clustering
- Modal clustering asymptotics with applications to bandwidth selection
- Model-based clustering with determinant-and-shape constraint
- Multivariate kernel smoothing and its applications
- On the estimation of the gradient lines of a density and the consistency of the mean-shift algorithm
- Robust double clustering: a method based on alternating concentration steps
- Robust inference for parsimonious model-based clustering
- Robust kernel density estimation
- Robust methods for data reduction
- Robust statistics. Theory and methods (with R)
- Robustness Properties of k Means and Trimmed k Means
- The estimation of the gradient of a density function, with applications in pattern recognition
- The power of monitoring: how to make the most of a contaminated multivariate sample
- Trimmed \(k\)-means: An attempt to robustify quantizers
- Weighted Likelihood Equations with Bootstrap Root Search
- Weighted likelihood mixture modeling and model-based clustering
This page was built for publication: Robust mean-shift clustering based on impartial trimming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924455)
