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>.
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.