Robust clustering based on trimming
From MaRDI portal
Cites work
- A classification EM algorithm for clustering and two stochastic versions
- A cluster-based outlier detection scheme for multivariate data
- A constrained robust proposal for mixture modeling avoiding spurious solutions
- A fast algorithm for robust constrained clustering
- A general trimming approach to robust cluster analysis
- A proposal for robust curve clustering
- A review of robust clustering methods
- A reweighting approach to robust clustering
- A robust method for cluster analysis
- Assessing trimming methodologies for clustering linear regression data
- Breakdown points for maximum likelihood estimators of location-scale mixtures
- Breakdown points of affine equivariant estimators of multivariate location and covariance matrices
- Cluster analysis with cellwise trimming and applications for the robust clustering of curves
- Cluster detection and clustering with random start forward searches
- Clusters, outliers, and regression: Fixed point clusters
- Co-clustering contaminated data: a robust model-based approach
- Constrained parsimonious model-based clustering
- Eigenvalues and constraints in mixture modeling: geometric and computational issues
- Exploratory tools for clustering multivariate data
- Exploring multivariate data with the forward search.
- Exploring the number of groups in robust model-based clustering
- Finding the Number of Normal Groups in Model-Based Clustering via Constrained Likelihoods
- Finite mixture models
- Graphical and Computational Tools to Guide Parameter Choice for the Cluster Weighted Robust Model
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
- How to find an appropriate clustering for mixed-type variables with application to socio-economic stratification
- scientific article; zbMATH DE number 194744 (Why is no real title available?)
- Identification of Outliers in Multivariate Data
- Impartial trimmed k-means for functional data
- Large-sample results for optimization-based clustering methods
- Least squares quantization in PCM
- Model-based clustering with determinant-and-shape constraint
- Model-Based Clustering, Classification, and Density Estimation Using mclust in R
- Model-Based Gaussian and Non-Gaussian Clustering
- On the breakdown behavior of the TCLUST clustering procedure
- Outlier detection in the multiple cluster setting using the minimum covariance determinant estimator
- Parsimonious mixtures of multivariate contaminated normal distributions
- Probabilistic clustering via Pareto solutions and significance tests
- Propagation of outliers in multivariate data
- Robust and sparse \(k\)-means clustering for high-dimensional data
- Robust cluster analysis and variable selection
- Robust clustering for functional data based on trimming and constraints
- Robust clustering tools based on optimal transportation
- Robust clusterwise linear regression through trimming
- Robust constrained fuzzy clustering
- Robust double clustering: a method based on alternating concentration steps
- Robust Estimation in the Normal Mixture Model Based on Robust Clustering
- Robust fitting of mixtures using the trimmed likelihood estimator
- Robust inference for parsimonious model-based clustering
- Robust linear clustering
- Robust mixture regression using the \(t\)-distribution
- Robust model-based clustering with mild and gross outliers
- Robust principal component analysis based on trimming around affine subspaces
- Robust statistics. Theory and methods (with R)
- Robustness and outliers
- Robustness Properties of k Means and Trimmed k Means
- Root selection in normal mixture models
- Semiautomatic robust regression clustering of international trade data
- Snipping for robust \(k\)-means clustering under component-wise contamination
- Soft clustering
- The importance of the scales in heterogeneous robust clustering
- The influence function of the TCLUST robust clustering procedure
- The joint role of trimming and constraints in robust estimation for mixtures of Gaussian factor analyzers
- Trimmed \(k\)-means: An attempt to robustify quantizers
- Trimmed best \(k\)-nets: A robustified version of an \(L_{\infty}\)-based clustering method
- Trimming algorithms for clustering contaminated grouped data and their robustness
- Wild adaptive trimming for robust estimation and cluster analysis
Cited in
(3)
This page was built for publication: Robust clustering based on trimming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642753)
