bigmatch: Making Optimal Matching Size-Scalable Using Optimal Calipers

Implements optimal matching with near-fine balance in large observational studies with the use of optimal calipers to get a sparse network. The caliper is optimal in the sense that it is as small as possible such that a matching exists. The main functions in the 'bigmatch' package are optcal() to find the optimal caliper, optconstant() to find the optimal number of nearest neighbors, and nfmatch() to find a near-fine balance match with a caliper and a restriction on the number of nearest neighbors. Yu, R., Silber, J. H., and Rosenbaum, P. R. (2020). <doi:10.1214/19-sts699>.

Version:	0.6.4
Imports:	rcbalance, stats, liqueueR, plyr, mvnfast, methods
Suggests:	optmatch, rrelaxiv
Published:	2022-08-11
Author:	Ruoqi Yu
Maintainer:	Ruoqi Yu <ruoqiyu125 at gmail.com>
License:	MIT + file LICENSE
NeedsCompilation:	no
Additional_repositories:	https://errickson.net/rrelaxiv/
CRAN checks:	bigmatch results

Documentation:

Reference manual:

bigmatch.pdf

Downloads:

Package source:	bigmatch_0.6.4.tar.gz
Windows binaries:	r-devel: bigmatch_0.6.4.zip, r-release: bigmatch_0.6.4.zip, r-oldrel: bigmatch_0.6.4.zip
macOS binaries:	r-release (arm64): bigmatch_0.6.4.tgz, r-oldrel (arm64): bigmatch_0.6.4.tgz, r-release (x86_64): bigmatch_0.6.4.tgz, r-oldrel (x86_64): bigmatch_0.6.4.tgz
Old sources:	bigmatch archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=bigmatch to link to this page.