get_est_cpp_dt: Summarize the posterior mean, sd, and confidence interval...

View source: R/RcppExports.R

get_est_cpp_dtR Documentation

Summarize the posterior mean, sd, and confidence interval (lower and upper endpoints)

Description

applicable to grouped or individual estimates by proper choices of prob1 and prob2; one or zeros give grouped estimates; probabilities give individual estimates

Usage

get_est_cpp_dt(
  prob1,
  prob2,
  mu_gamma,
  sigma_gamma,
  mu_alpha,
  sigma_alpha,
  anc1,
  anc2,
  cardanc1,
  cardanc2,
  z
)

Arguments

prob1, prob2

variational probabilities; prob1 is for s*_u - length p1; prob2 is for s_cu - a matrix pL1 by p2; in R, a list of pL1 length - each element being of length p2.

mu_gamma

variational Gaussian means (for s*_u=1 component) for J*K logit(class-specific response probabilities); (J,K,p1) array; In R, we used a list of p1 (J,K) matrices

sigma_gamma

variational Gaussian variances (for s*_u=1 component) for J*K logit(class-specific response probabilities); (J,K,p1) array; in R, we used a list o f p1 (J,K) matrices

mu_alpha

variational Gaussian mean vectors (for s_cu=1 component) - this is a pL1 by K-1 by p2 array; in R, we used a list of p2 matrices (each of dimension pL1 by K-1)

sigma_alpha

variational Gaussian variances (for s_cu=1 component)

  • this is an array of dimension (pL1, K-1, p2); in R, we used a list of p2 matrices, each of dimension pL1 by K-1.

anc1, anc2

anc1 is a list of pL1 vectors, each vector has the node ids of the ancestors in tree1; lengths may differ. The ancestors include the node concerned; similarly for anc2

cardanc1, cardanc2

cardanc1 is a numeric vector of length pL1; integers. The number of ancestors for each leaf node in tree1; similarly for cardanc2.

z

double z= ci_level+(1-ci_level)/2

Value

a List

List::create(Named("beta_est")=beta_est, Named("beta_sd")=beta_sd, Named("beta_cil")=beta_cil, Named("beta_ciu")=beta_ciu, Named("eta_est")=eta_est, Named("eta_sd")=eta_sd, Named("eta_cil")=eta_cil, Named("eta_ciu")=eta_ciu);


zhenkewu/doubletree documentation built on Oct. 21, 2023, 7:04 a.m.