ccoptimalmatch
Implementation of Case-Control Optimal Matching
Cases are matched to controls in an efficient, optimal and computationally flexible way. It uses the idea of sub-sampling in the level of the case, by creating pseudo-observations of controls. The user can select between replacement and without replacement, the number of controls, and several covariates to match upon. See Mamouris (2021) <doi:10.1186/s12874-021-01256-3> for an overview.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | ccoptimalmatch_0.1.0.tar.gz |
231.3 KiB |
0.1.0 |
rolling linux/noble R-4.5 | ccoptimalmatch_0.1.0.tar.gz |
231.2 KiB |
0.1.0 |
rolling source/ R- | ccoptimalmatch_0.1.0.tar.gz |
403.0 KiB |
0.1.0 |
latest linux/jammy R-4.5 | ccoptimalmatch_0.1.0.tar.gz |
231.3 KiB |
0.1.0 |
latest linux/noble R-4.5 | ccoptimalmatch_0.1.0.tar.gz |
231.2 KiB |
0.1.0 |
latest source/ R- | ccoptimalmatch_0.1.0.tar.gz |
403.0 KiB |
0.1.0 |
2026-04-26 source/ R- | ccoptimalmatch_0.1.0.tar.gz |
403.0 KiB |
0.1.0 |
2026-04-23 source/ R- | ccoptimalmatch_0.1.0.tar.gz |
403.0 KiB |
0.1.0 |
2026-04-09 windows/windows R-4.5 | ccoptimalmatch_0.1.0.zip |
236.4 KiB |
0.1.0 |
2025-04-20 source/ R- | ccoptimalmatch_0.1.0.tar.gz |
403.0 KiB |