Finding approximate solutions to combinatorial problems with very large data sets using BIRCH

DOI10.1016/J.CSDA.2008.08.001MaRDI QIDQ962302zbMATH OpenOpenAlexFDO

Authors Justin Harrington, Matías Salibián Barrera

Publication date 6 April 2010

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.csda.2008.08.001

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Robustness and adaptive procedures (parametric inference) (62F35)

Recommendations

• Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets
• scientific article; zbMATH DE number 2058049
• scientific article; zbMATH DE number 1718514
• Improved feasible solution algorithms for high breakdown estimation.
• The feasible solution algorithm for least trimmed squares regression

Cites work

• scientific article; zbMATH DE number 2058049 (Why is no real title available?)
• scientific article; zbMATH DE number 194744 (Why is no real title available?)
• Least Median of Squares Regression
• Linear grouping using orthogonal regression

Cited in

(4)

• Special issue on variable selection and robust procedures
• Morph-based local-search heuristics for large-scale combinatorial data analysis
• Editorial: Second special issue on statistical algorithms and software
• Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets

This page was built for publication: Finding approximate solutions to combinatorial problems with very large data sets using BIRCH

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