A robust linear grouping algorithm
From MaRDI portal
Publication:3298585
DOI10.1007/978-3-7908-1709-6_4zbMath1437.62036OpenAlexW2187154807MaRDI QIDQ3298585
Ruben H. Zamar, Stefan Van Aelst, Greet Pison
Publication date: 15 July 2020
Published in: Compstat 2006 - Proceedings in Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-7908-1709-6_4
Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- Algorithm AS 136: A K-Means Clustering Algorithm
- A maximum likelihood methodology for clusterwise linear regression
- Outlier detection in the multiple cluster setting using the minimum covariance determinant estimator
- Linear grouping using orthogonal regression
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- A fast algorithm for clusterwise linear regression
- On problem solving with Hopfield neural networks
- Trimmed \(k\)-means: An attempt to robustify quantizers
- Least Median of Squares Regression
- A Survey of Recent Advances in Hierarchical Clustering Algorithms
- Robust estimation in the errors-in-variables model
- Finding Groups in Data
- Model-Based Gaussian and Non-Gaussian Clustering
- Robustness Properties of k Means and Trimmed k Means
