Found 142 packages in 0.02 seconds
Comparison of Variance - Covariance Patterns
Comparison of variance - covariance patterns using relative principal component analysis (relative eigenanalysis), as described in Le Maitre and Mitteroecker (2019)
Warping Landmark Configurations
Compute bending energies, principal warps, partial warp scores, and the non-affine component of shape variation for 2D landmark configurations, as well as Mardia-Dryden distributions and self-similar distributions of landmarks, as described in Mitteroecker et al. (2020)
'Trial Sequential Analysis' for Error Control and Inference in Sequential Meta-Analyses
Frequentist sequential meta-analysis based on
'Trial Sequential Analysis' (TSA) in programmed in Java by the Copenhagen
Trial Unit (CTU). The primary function is the calculation of group
sequential designs for meta-analysis to be used for planning and analysis of
both prospective and retrospective sequential meta-analyses to preserve
type-I-error control under sequential testing. 'RTSA' includes tools for
sample size and trial size calculation for meta-analysis and core
meta-analyses methods such as fixed-effect and random-effects models and
forest plots. TSA is described in Wetterslev et. al (2008)
Discrete Distribution Approximations
Creates discretised versions of continuous
distribution functions by mapping continuous values
to an underlying discrete grid, based on a (uniform)
frequency of discretisation, a valid discretisation
point, and an integration range. For a review of
discretisation methods, see
Chakraborty (2015)
Truncated Functional Generalized Linear Models
An implementation of the methodologies described in Xi Liu, Afshin A. Divani, and Alexander Petersen (2022)
Bayesian Modeling of Archaeological Chronologies
Provides a list of functions for the Bayesian modeling of archaeological chronologies. The Bayesian models are implemented in 'JAGS' ('JAGS' stands for Just Another Gibbs Sampler. It is a program for the analysis of Bayesian hierarchical models using Markov Chain Monte Carlo (MCMC) simulation. See < http://mcmc-jags.sourceforge.net/> and "JAGS Version 4.3.0 user manual", Martin Plummer (2017) < https://sourceforge.net/projects/mcmc-jags/files/Manuals/>.). The inputs are measurements with their associated standard deviations and the study period. The output is the MCMC sample of the posterior distribution of the event date with or without radiocarbon calibration.
Fits a Model that Partitions the Covariate Space into Blocks in a Data- Adaptive Way
Implements convex regression with interpretable sharp partitions (CRISP), which considers the problem of predicting an outcome variable on the basis of two covariates, using an interpretable yet non-additive model. CRISP partitions the covariate space into blocks in a data-adaptive way, and fits a mean model within each block. Unlike other partitioning methods, CRISP is fit using a non-greedy approach by solving a convex optimization problem, resulting in low-variance fits. More details are provided in Petersen, A., Simon, N., and Witten, D. (2016). Convex Regression with Interpretable Sharp Partitions. Journal of Machine Learning Research, 17(94): 1-31 < http://jmlr.org/papers/volume17/15-344/15-344.pdf>.
Translate Integers into English
Allow numbers to be presented in an English language version, one, two, three, ... Ordinals are also available, first, second, third, ... and indefinite article choice, "a" or "an".
Sample Selection Models
Two-step and maximum likelihood estimation of Heckman-type sample selection models: standard sample selection models (Tobit-2), endogenous switching regression models (Tobit-5), sample selection models with binary dependent outcome variable, interval regression with sample selection (only ML estimation), and endogenous treatment effects models. These methods are described in the three vignettes that are included in this package and in econometric textbooks such as Greene (2011, Econometric Analysis, 7th edition, Pearson).
Robust Selection Algorithm
An implementation of algorithms for estimation of the graphical lasso regularization parameter described in Pedro Cisneros-Velarde, Alexander Petersen and Sang-Yun Oh (2020) < http://proceedings.mlr.press/v108/cisneros20a.html>.