Renvlp (Q54070)

From MaRDI portal
Revision as of 12:55, 4 March 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
Computing Envelope Estimators
Language Label Description Also known as
English
Renvlp
Computing Envelope Estimators

    Statements

    0 references
    3.3
    7 January 2023
    0 references
    3.4
    19 April 2023
    0 references
    2.5
    18 January 2018
    0 references
    2.6.5
    27 February 2019
    0 references
    2.6
    19 February 2019
    0 references
    2.7
    23 July 2019
    0 references
    2.8
    16 March 2020
    0 references
    2.9
    15 November 2020
    0 references
    3.0
    11 September 2021
    0 references
    3.1
    13 May 2022
    0 references
    3.2
    7 August 2022
    0 references
    3.4.5
    10 October 2023
    0 references
    0 references
    0 references
    10 October 2023
    0 references
    Provides a general routine, envMU, which allows estimation of the M envelope of span(U) given root n consistent estimators of M and U. The routine envMU does not presume a model. This package implements response envelopes, partial response envelopes, envelopes in the predictor space, heteroscedastic envelopes, simultaneous envelopes, scaled response envelopes, scaled envelopes in the predictor space, groupwise envelopes, weighted envelopes, envelopes in logistic regression, envelopes in Poisson regression envelopes in function-on-function linear regression, envelope-based Partial Partial Least Squares, envelopes with non-constant error covariance, envelopes with t-distributed errors, reduced rank envelopes and reduced rank envelopes with non-constant error covariance. For each of these model-based routines the package provides inference tools including bootstrap, cross validation, estimation and prediction, hypothesis testing on coefficients are included except for weighted envelopes. Tools for selection of dimension include AIC, BIC and likelihood ratio testing. Background is available at Cook, R. D., Forzani, L. and Su, Z. (2016) <doi:10.1016/j.jmva.2016.05.006>. Optimization is based on a clockwise coordinate descent algorithm.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references