A robust linear grouping algorithm

DOI10.1007/978-3-7908-1709-6_4MaRDI QIDQ3298585zbMATH OpenOpenAlexFDO

Authors Stefan Van Aelst, Ruben H. Zamar, 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

zbMATH Keywords

trimmingrobustnesslinear grouping

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• New linear grouping algorithm based on total least absolute deviation criteria
• Linear grouping using orthogonal regression
• Robust linear clustering
• An algorithm for robust linear estimation with grouped data
• Trimming algorithms for clustering contaminated grouped data and their robustness

Cites work

• scientific article; zbMATH DE number 3936253 (Why is no real title available?)
• scientific article; zbMATH DE number 47593 (Why is no real title available?)
• scientific article; zbMATH DE number 52749 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 1792110 (Why is no real title available?)
• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• scientific article; zbMATH DE number 837911 (Why is no real title available?)
• A Survey of Recent Advances in Hierarchical Clustering Algorithms
• A fast algorithm for clusterwise linear regression
• A maximum likelihood methodology for clusterwise linear regression
• Algorithm AS 136: A K-Means Clustering Algorithm
• Estimating the number of clusters in a data set via the gap statistic
• Finding Groups in Data
• Least Median of Squares Regression
• Linear grouping using orthogonal regression
• Model-Based Gaussian and Non-Gaussian Clustering
• On problem solving with Hopfield neural networks
• Outlier detection in the multiple cluster setting using the minimum covariance determinant estimator
• Robust estimation in the errors-in-variables model
• Robustness Properties of k Means and Trimmed k Means
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Trimmed \(k\)-means: An attempt to robustify quantizers

Cited in

(3)

• Linear processing with pregroups
• Linear grouping using orthogonal regression
• New linear grouping algorithm based on total least absolute deviation criteria

Describes a project that uses

Uses Software

• Algorithm 39
• AS 136
• Silhouettes

This page was built for publication: A robust linear grouping algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3298585)