Pages that link to "Item:Q1072298"

The following pages link to Algorithms and complexity for least median of squares regression (Q1072298):

Displaying 14 items.

• The feasible set algorithm for least median of squares regression (Q137210) (← links)
• SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression (Q319716) (← links)
• Least quantile regression via modern optimization (Q482902) (← links)
• Efficient sorting during repetitive statistical computations: Algorithms and an application (Q804105) (← links)
• An entropy-like estimator for robust parameter identification (Q845427) (← links)
• The determination of a ``least quantile of squares regression line'' for all quantiles (Q1350244) (← links)
• Parallel algorithms for least median of squares regression (Q1361581) (← links)
• BACON: blocked adaptive computationally efficient outlier nominators. (Q1583192) (← links)
• Robust estimation of the parameters of \(g\)-\textit{and}-\(h\) distributions, with applications to outlier detection (Q1623475) (← links)
• Asymmetric \(\nu\)-tube support vector regression (Q1623610) (← links)
• On the implementation of LIR: the case of simple linear regression with interval data (Q2259750) (← links)
• An Exact Algorithm for Likelihood-Based Imprecise Regression in the Case of Simple Linear Regression with Interval Data (Q2805800) (← links)
• Formulas for the Exact LMS and LQS Estimators (Q2903839) (← links)
• Some geometric lower bounds (Q6487948) (← links)