optmatch (Q20176): Difference between revisions
From MaRDI portal
Created claim: source code repository (P339): https://github.com/cran/optmatch, #quickstatements; #temporary_batch_1711027662947 |
Swh import (talk | contribs) SWHID from Software Heritage |
||||||||||||||
Property / Software Heritage ID | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:75eae0f554c5632eb09178dcfe7c2da1daf4e5e0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:75eae0f554c5632eb09178dcfe7c2da1daf4e5e0 / qualifier | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:75eae0f554c5632eb09178dcfe7c2da1daf4e5e0 / qualifier | |||||||||||||||
point in time: 2 December 2023
|
Latest revision as of 15:32, 21 March 2024
Functions for Optimal Matching
Language | Label | Description | Also known as |
---|---|---|---|
English | optmatch |
Functions for Optimal Matching |
Statements
15 November 2023
0 references
Distance based bipartite matching using minimum cost flow, oriented to matching of treatment and control groups in observational studies ('Hansen' and 'Klopfer' 2006 <doi:10.1198/106186006X137047>). Routines are provided to generate distances from generalised linear models (propensity score matching), formulas giving variables on which to limit matched distances, stratified or exact matching directives, or calipers, alone or in combination.
0 references