Cited by 702Advanced Causal Inference TechniquesOptimal Experimental Design MethodsStatistical Methods in Clinical Trials

Comparison of Multivariate Matching Methods: Structures, Distances, and Algorithms

Gu, Xing Sam, Rosenbaum, Paul R.·1993·Journal of Computational and Graphical Statistics

Abstract

A comparison and evaluation is made of recent proposals for multivariate matched sampling in observational studies, where the following three questions are answered: (1) Algorithms: In current statistical practice, matched samples are formed using “nearest available” matching, a greedy algorithm. Greedy matching does not minimize the total distance within matched pairs, though good algorithms exist for optimal matching that do minimize the total distance. How much better is optimal matching than greedy matching? We find that optimal matching is sometimes noticeably better than greedy matching in the sense of producing closely matched pairs, sometimes only marginally better, but it is no better than greedy matching in the sense of producing balanced matched samples. (2) Structures: In common practice, treated units are matched to one control, called pair matching or 1–1 matching, or treated units are matched to two controls, called 1–2 matching, and so on. It is known, however, that the optimal structure is a full matching in which a treated unit may have one or more controls or a control may have one or more treated units. Optimal 1 — k matching is compared to optimal full matching, finding that optimal full matching is often much better. (3) Distances: Matching involves defining a distance between covariate vectors, and several such distances exist. Three recent proposals are compared. Practical advice is summarized in a final section.

Integrity signals

Registry

Crossref · 10.1080/10618600.1993.10474623

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cited by

Sorted by citations

Authors
Gu, X. S., & Rosenbaum, P. R.
Affiliations
  • C.S. First Boston Hong Kong, Ltd.
  • University of Pennsylvania (US)
Venue
Journal of Computational and Graphical Statistics
Published
1993-12
Volume
2
Issue
4
Pages
405-420
ISSN
  • 1061-8600 (ISSN-L)
  • 1537-2715
OpenAlex
W2030614017
Cited by
702
References
0
Citations by year
2026: 20 · 2025: 29 · 2024: 27 · 2023: 32 · 2022: 35 · 2021: 41 · 2020: 46 · 2019: 37 · 2018: 51 · 2017: 36 · 2016: 36 · 2015: 40 · 2014: 36 · 2013: 35 · 2012: 27
FWCI
1.01
Type
journal article
Language
en
Open access
closed
Locations
Journal of Computational and Graphical Statistics (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Statistics and Probability › Advanced Causal Inference Techniques
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Optimal Experimental Design Methods
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods in Clinical Trials
Keywords
optimal matching, greedy matching, pair matching, covariate balance, distance measures, observational studies

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review