FLAME
Interpretable Matching for Causal Inference
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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
2.1.1 |
rolling source/ R- | FLAME_2.1.1.tar.gz |
216.1 KiB |
2.1.1 |
latest source/ R- | FLAME_2.1.1.tar.gz |
216.1 KiB |
2.1.1 |
2026-04-23 source/ R- | FLAME_2.1.1.tar.gz |
216.1 KiB |
2.1.1 |
2026-04-09 windows/windows R-4.5 | FLAME_2.1.1.zip |
301.8 KiB |