A criterion based on the Mahalanobis distance for cluster analysis with subsampling
From MaRDI portal
Publication:263330
Recommendations
Cites work
- scientific article; zbMATH DE number 3810727 (Why is no real title available?)
- scientific article; zbMATH DE number 4079233 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 194758 (Why is no real title available?)
- scientific article; zbMATH DE number 3800811 (Why is no real title available?)
- scientific article; zbMATH DE number 3429948 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- A classification EM algorithm for clustering and two stochastic versions
- A maximum likelihood methodology for clusterwise linear regression
- Algorithm AS 136: A K-Means Clustering Algorithm
- Almost Nonparametric Inference for Repeated Measures in Mixture Models
- Finite mixture models
- Identifiability of finite mixtures of multinomial logit models with varying and fixed effects
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Model-Based Gaussian and Non-Gaussian Clustering
- On the estimation of the influence curve
- The Influence Curve and Its Role in Robust Estimation
This page was built for publication: A criterion based on the Mahalanobis distance for cluster analysis with subsampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263330)