RBestMatch: Graded Matching for Large Observational Studies

R-best matching is a new graded matching strategy in which potential pairings are graded, with a preference for higher grade pairings. An r-best match tries to match with pairs of the best grade, incorporating progressively lower grade pairs only to the degree they are needed, and only needs to use edges in the r best grades. In effect, only sparse networks are built, stored and optimized.

Version: 0.1.1
Depends: R (≥ 3.5.0)
Imports: stats, plyr, mvnfast, methods, DiPs
Suggests: optmatch
Published: 2021-12-21
Author: Ruoqi Yu
Maintainer: Ruoqi Yu <ruoqiyu at berkeley.edu>
License: file LICENSE
NeedsCompilation: no
CRAN checks: RBestMatch results


Reference manual: RBestMatch.pdf


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


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