Installation
About
Efficient implementations of the algorithms in the Almost-Matching-Exactly framework for interpretable matching in causal inference. These algorithms match units via a learned, weighted Hamming distance that determines which covariates are more important to match on. For more information and examples, see the Almost-Matching-Exactly website.
almost-matching-exactly.github.io | |
vittorioorlandi.github.io/ | |
Bug report | File report |
Key Metrics
Downloads
Yesterday | 16 +220% |
Last 7 days | 150 +1% |
Last 30 days | 699 -7% |
Last 90 days | 2.199 +34% |
Last 365 days | 7.703 -4% |