optmatch - 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 <doi:10.1198/106186006X137047>). 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.
Last updated 3 days ago
matching
12.13 score 47 stars 4 packages 580 scripts 5.8k downloads
rlemon - R Access to LEMON Graph Algorithms
Allows easy access to the LEMON Graph Library set of algorithms, written in C++. See the LEMON project page at <https://lemon.cs.elte.hu/trac/lemon>. Current LEMON version is 1.3.1.
Last updated 2 months ago
6.88 score 8 stars 12 packages 1 scripts 3.3k downloads
howManyImputations - Calculate How many Imputations are Needed for Multiple Imputation
When performing multiple imputations, while 5-10 imputations are sufficient for obtaining point estimates, a larger number of imputations are needed for proper standard error estimates. This package allows you to calculate how many imputations are needed, following the work of von Hippel (2020) <doi:10.1177/0049124117747303>.
Last updated 3 months ago
4.30 score 8 stars 8 scripts 234 downloads