✦ LIBER ✦

Probabilistic algorithms for least median of squares regression

✍ Scribed by Johann Joss; Alfio Marazzi

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 667 KB
Volume: 9
Category: Article
ISSN: 0167-9473
DOI: 10.1016/0167-9473(90)90075-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for least median of

Parallel algorithms for least median of squares regression

✍ Chong-wei Xu; Wei-Kei Shiue 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 939 KB

Recursive algorithm for partial least sq

Recursive algorithm for partial least squares regression

✍ Kristian Helland; Hans E. Berntsen; Odd S. Borgen; Harald Martens 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 829 KB

LMSMVE: A program for least median of sq

LMSMVE: A program for least median of squares regression and robust distances

✍ Gerard E. Dallal; Peter J. Rousseeuw 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 466 KB

The program LMSMVE performs robust regression analysis by using the method of the least median of squares. It also computes robust distances to locate leverage points. that is. outliers with respect to the set of independent variables. LMSMVE constructs plots of least median of squares residuals aga

The feasible solution algorithm for leas

The feasible solution algorithm for least trimmed squares regression

✍ Douglas M. Hawkins 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 914 KB

Robust regression with a distributed int

Robust regression with a distributed intercept using least median of squares

✍ Peter J. Rousseeuw; Joachim Wagner 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Parallel algorithms for downdating the l

Parallel algorithms for downdating the least squares estimator of the regression model

✍ Petko I. Yanev; Erricos J. Kontoghiorghes 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 993 KB

Computationally efficient parallel algorithms for downdating the least squares estimator of the ordinary linear regression are proposed. The algorithms, which are based on the QR decomposition, are block versions of sequential Givens strategies and efficiently exploit the triangular structure of the