The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
kendallknight: Efficient Implementation of Kendall's Correlation Coefficient
Computation
The computational complexity of the implemented algorithm for
Kendall's correlation is O(n log(n)), which is faster than the base R
implementation with a computational complexity of O(n^2). For small vectors
(i.e., less than 100 observations), the time difference is negligible.
However, for larger vectors, the speed difference can be substantial and the
numerical difference is minimal. The references are
Knight (1966) <doi:10.2307/2282833>,
Abrevaya (1999) <doi:10.1016/S0165-1765(98)00255-9>,
Christensen (2005) <doi:10.1007/BF02736122> and
Emara (2024) <https://learningcpp.org/>.
This implementation is described in
Vargas Sepulveda (2024) <doi:10.48550/arXiv.2408.09618>.
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=kendallknight
to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.
[aut, cre],
Loader Catherine [ctb] (original stirlerr implementations in C (2000)),
Ross Ihaka [ctb] (original chebyshev_eval, gammafn and lgammacor
implementations in C (1998))