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 number of nearest neighbors. Glover, F. (1967). <doi:10.1002/nav.3800140304>. Lipski, W., Jr, and Preparata, F. P. (1981). <doi:10.1007/BF00264533>. Rosenbaum, P.R. (1989). <doi:10.1080/01621459.1989.10478868>. Yang, D., Small, D. S., Silber, J. H., and Rosenbaum, P. R. (2012). <doi:10.1111/j.1541-0420.2011.01691.x>.

Version: 0.6.1
Imports: rcbalance, stats, liqueueR, plyr, mvnfast, methods
Suggests: optmatch
Published: 2019-01-02
Author: Ruoqi Yu
Maintainer: Ruoqi Yu <ruoqiyu at>
License: file LICENSE
NeedsCompilation: no
CRAN checks: bigmatch results


Reference manual: bigmatch.pdf
Package source: bigmatch_0.6.1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X binaries: r-release: bigmatch_0.6.1.tgz, r-oldrel: bigmatch_0.6.1.tgz
Old sources: bigmatch archive


Please use the canonical form to link to this page.