Nothing
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.
Package details |
|
---|---|
Author | Vittorio Orlandi [aut, cre], Sudeepa Roy [aut], Cynthia Rudin [aut], Alexander Volfovsky [aut] |
Maintainer | Vittorio Orlandi <almost.matching.exactly@gmail.com> |
License | MIT + file LICENSE |
Version | 2.1.1 |
URL | https://almost-matching-exactly.github.io https://vittorioorlandi.github.io/ |
Package repository | View on CRAN |
Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.