|
Title
|
|
|
|
robslopes : efficient computation of the (repeated) median slope
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| Modern use of slope estimation often involves the (repeated) estimation of a large number of slopes on a large number of data points. Some of the most popular non-parametric and robust alternatives to the least squares estimator are the Theil-Sen and Siegel’s repeated median slope estimators. The robslopes package contains fast algorithms for these slope estimators. The implemented randomized algorithms run in O(nlog(n)) and O(nlog2(n)) expected time respectively and use O(n) space. They achieve speedups up to a factor 103 compared with existing implementations for common sample sizes, as illustrated in a benchmark study, and they allow for the possibility of estimating the slopes on samples of size 105 and larger thanks to the limited space usage. Finally, the original algorithms are adjusted in order to properly handle duplicate values in the data set. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
The R journal / R Foundation for Statistical Computing; Technische Universität Wien. Institut für Statistik und Wahrscheinlichkeitstheorie. - Boston, MA, 2009, currens
| |
|
Publication
|
|
|
|
Boston, MA
:
R Foundation for Statistical Computing
,
2023
| |
|
ISSN
|
|
|
|
2073-4859
| |
|
DOI
|
|
|
|
10.32614/RJ-2023-012
| |
|
Volume/pages
|
|
|
|
14
:4
(2022)
, p. 38-49
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|
Full text (open access)
|
|
|
|
| |
|