2020
DOI: 10.1007/978-3-030-62509-2_14
|View full text |Cite
|
Sign up to set email alerts
|

Rank Estimators for Robust Regression: Approximate Algorithms, Exact Algorithms and Two-Stage Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…By using a simulation study, proposed estimators are proved efficient, asymptotically normal, and valid, also a real dataset with inherent hierarchy is used for illustration. Cerný et al [25] studied algorithms for minimization of Jaeckel's dispersion function to reach the robust rank estimator that is insensitive to outliers. A new two-stage algorithm is developed merging the benefits of two algorithms already used in the literature, approximate and exact algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…By using a simulation study, proposed estimators are proved efficient, asymptotically normal, and valid, also a real dataset with inherent hierarchy is used for illustration. Cerný et al [25] studied algorithms for minimization of Jaeckel's dispersion function to reach the robust rank estimator that is insensitive to outliers. A new two-stage algorithm is developed merging the benefits of two algorithms already used in the literature, approximate and exact algorithms.…”
Section: Introductionmentioning
confidence: 99%