Functions for Optimal Matching

Distance based bipartite matching using minimum cost flow, oriented to matching of treatment and control groups in observational studies ('Hansen' and 'Klopfer' 2006 ). Routines are provided to generate distances from generalised linear models (propensity score matching), formulas giving variables on which to limit matched distances, stratified or exact matching directives, or calipers, alone or in combination.

Signal Processing

R implementation of the 'Octave' package 'signal', containing a variety of signal processing tools, such as signal generation and measurement, correlation and convolution, filtering, filter design, filter analysis and conversion, power spectrum analysis, system identification, decimation and sample rate change, and windowing.

Data Table Back-End for 'dplyr'

Provides a data.table backend for 'dplyr'. The goal of 'dtplyr' is to allow you to write 'dplyr' code that is automatically translated to the equivalent, but usually much faster, data.table code.

Fast Cross-Validation for Multi-Penalty Ridge Regression

Multi-penalty linear, logistic and cox ridge regression, including estimation of the penalty parameters by efficient (repeated) cross-validation and marginal likelihood maximization. Multiple high-dimensional data types that require penalization are allowed, as well as unpenalized variables. Paired and preferential data types can be specified. See Van de Wiel et al. (2021), .

Analyzing Dendrometer Data

Various functions to import, verify, process and plot high-resolution dendrometer data using daily and stem-cycle approaches as described in Deslauriers et al, 2007 . For more details about the package please see: Van der Maaten et al. 2016 .

R Code for Mark Analysis

An interface to the software package MARK that constructs input files for MARK and extracts the output. MARK was developed by Gary White and is freely available at < http://www.phidot.org/software/mark/downloads/> but is not open source.

"Hit and Run" and "Shake and Bake" for Sampling Uniformly from Convex Shapes

The "Hit and Run" Markov Chain Monte Carlo method for sampling uniformly from convex shapes defined by linear constraints, and the "Shake and Bake" method for sampling from the boundary of such shapes. Includes specialized functions for sampling normalized weights with arbitrary linear constraints. Tervonen, T., van Valkenhoef, G., Basturk, N., and Postmus, D. (2012) . van Valkenhoef, G., Tervonen, T., and Postmus, D. (2014) .

Tidy Interface to 'data.table'

A tidy interface to 'data.table', giving users the speed of 'data.table' while using tidyverse-like syntax.

Classification and Regression Tests

Provides wrapper functions for running classification and regression tests using different machine learning techniques, such as Random Forests and decision trees. The package provides standardized methods for preparing data to suit the algorithm's needs, training a model, making predictions, and evaluating results. Also, some functions are provided to run multiple instances of a test.

Highly Adaptive Lasso Conditional Density Estimation

An algorithm for flexible conditional density estimation based on application of pooled hazard regression to an artificial repeated measures dataset constructed by discretizing the support of the outcome variable. To facilitate non/semi-parametric estimation of the conditional density, the highly adaptive lasso, a nonparametric regression function shown to reliably estimate a large class of functions at a fast convergence rate, is utilized. The pooled hazards data augmentation formulation implemented was first described by Díaz and van der Laan (2011) . To complement the conditional density estimation utilities, tools for efficient nonparametric inverse probability weighted (IPW) estimation of the causal effects of stochastic shift interventions (modified treatment policies), directly utilizing the density estimation technique for construction of the generalized propensity score, are provided. These IPW estimators utilize undersmoothing (sieve estimation) of the conditional density estimators in order to achieve the non/semi-parametric efficiency bound.