4.3 Article Book Chapter

Modern Algorithms for Matching in Observational Studies

出版社

ANNUAL REVIEWS
DOI: 10.1146/annurev-statistics-031219-041058

关键词

assignment algorithm; causal inference; design sensitivity; integer programming; fine balance; Mahalanobis distance; near-fine balance; network optimization; optimal matching; principal unobserved covariate; propensity score; refined balance; sensitivity analysis

向作者/读者索取更多资源

Using a small example as an illustration, this article reviews multivariate matching from the perspective of a working scientist who wishes to make effective use of available methods. The several goals of multivariate matching are discussed. Matching tools are reviewed, including propensity scores, covariate distances, fine balance, and related methods such as near-fine and refined balance, exact and near-exact matching, tactics addressing missing covariate values, the entire number, and checks of covariate balance. Matching structures are described, such as matching with a variable number of controls, full matching, subset matching and risk-set matching. Software packages in R are described. A brief review is given of the theory underlying propensity scores and the associated sensitivity analysis concerning an unobserved covariate omitted from the propensity score.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据