Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Ruoqi Yu |
| Maintainer | Ruoqi Yu <ruoqiyu@berkeley.edu> |
| License | MIT+file LICENSE |
| Version | 0.1.1 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the RBestMatch package in your browser
Any scripts or data that you put into this service are public.
