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.

regda: Regularised Discriminant Analysis

Regularised discriminant analysis functions. The classical regularised discriminant analysis proposed by Friedman in 1989, including cross-validation, of which the linear and quadratic discriminant analyses are special cases. Further, the regularised maximum likelihood linear discriminant analysis, including cross-validation. References: Friedman J.H. (1989): "Regularized Discriminant Analysis". Journal of the American Statistical Association 84(405): 165–175. <doi:10.2307/2289860>. Friedman J., Hastie T. and Tibshirani R. (2009). "The elements of statistical learning", 2nd edition. Springer, Berlin. <doi:10.1007/978-0-387-84858-7>. Tsagris M., Preston S. and Wood A.T.A. (2016). "Improved classification for compositional data using the alpha-transformation". Journal of Classification, 33(2): 243–261. <doi:10.1007/s00357-016-9207-5>.

Version: 1.0
Depends: R (≥ 4.0)
Imports: doParallel, foreach, parallel, Rfast, Rfast2, stats
Published: 2023-11-06
DOI: 10.32614/CRAN.package.regda
Author: Michail Tsagris [aut, cre]
Maintainer: Michail Tsagris <mtsagris at uoc.gr>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: no
CRAN checks: regda results

Documentation:

Reference manual: regda.pdf

Downloads:

Package source: regda_1.0.tar.gz
Windows binaries: r-devel: regda_1.0.zip, r-release: regda_1.0.zip, r-oldrel: regda_1.0.zip
macOS binaries: r-release (arm64): regda_1.0.tgz, r-oldrel (arm64): regda_1.0.tgz, r-release (x86_64): regda_1.0.tgz, r-oldrel (x86_64): regda_1.0.tgz

Reverse dependencies:

Reverse imports: Compositional

Linking:

Please use the canonical form https://CRAN.R-project.org/package=regda 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.