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.
Version: 2.1.1 Imports: glmnet, gmp Suggests: nnet, knitr, mice, rmarkdown, testthat, xgboost Published: 2021-12-07 DOI: 10.32614/CRAN.package.FLAME Author: Vittorio Orlandi [aut, cre], Sudeepa Roy [aut], Cynthia Rudin [aut], Alexander Volfovsky [aut] Maintainer: Vittorio Orlandi <almost.matching.exactly at gmail.com> BugReports: https://github.com/vittorioorlandi/FLAME/issues License: MIT + file LICENSE URL: https://almost-matching-exactly.github.io,https://vittorioorlandi.github.io/ NeedsCompilation: no In views: CausalInference CRAN checks: FLAME results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=FLAME to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4