nbpMatching

swMATH6785CRANnbpMatchingMaRDI QIDQ18860

Functions for Optimal Non-Bipartite Matching

Last update: 19 August 2023

Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0

Software version identifier: 1.5.1, 1.0, 1.3.2, 1.3.6, 1.4.0, 1.4.4, 1.4.5, 1.5.0, 1.5.4

Source code repository: https://github.com/cran/nbpMatching

Description

Perform non-bipartite matching and matched randomization. A "bipartite" matching utilizes two separate groups, e.g. smokers being matched to nonsmokers or cases being matched to controls. A "non-bipartite" matching creates mates from one big group, e.g. 100 hospitals being randomized for a two-arm cluster randomized trial or 5000 children who have been exposed to various levels of secondhand smoke and are being paired to form a greater exposure vs. lesser exposure comparison. At the core of a non-bipartite matching is a N x N distance matrix for N potential mates. The distance between two units expresses a measure of similarity or quality as mates (the lower the better). The 'gendistance()' and 'distancematrix()' functions assist in creating this. The 'nonbimatch()' function creates the matching that minimizes the total sum of distances between mates; hence, it is referred to as an "optimal" matching. The 'assign.grp()' function aids in performing a matched randomization. Note bipartite matching can be performed using the prevent option in 'gendistance()'.

Related Items (22)

On some exact distribution-free tests of independence between two random vectors of arbitrary dimensions ⋮ Subgroup causal effect identification and estimation via matching tree ⋮ Graded Matching for Large Observational Studies ⋮ Targeted learning in data science. Causal inference for complex longitudinal studies ⋮ Optimal Matching with Minimal Deviation from Fine Balance in a Study of Obesity and Surgical Outcomes ⋮ Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies ⋮ Graph-theoretic multisample tests of equality in distribution for high dimensional data ⋮ Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies ⋮ Social distancing and COVID-19: randomization inference for a structured dose-response relationship ⋮ Statistical matching and subclassification with a continuous dose: characterization, algorithm, and application to a health outcomes study ⋮ Stronger instruments via integer programming in an observational study of late preterm birth outcomes ⋮ A class of multivariate distribution-free tests of independence based on graphs ⋮ Matching methods for observational studies derived from large administrative databases ⋮ Matching for balance, pairing for heterogeneity in an observational study of the effectiveness of for-profit and not-for-profit high schools in Chile ⋮ nearfar ⋮ Impact of Multiple Matched Controls on Design Sensitivity in Observational Studies ⋮ Isolation in the construction of natural experiments ⋮ Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies ⋮ GPSCDF ⋮ On some graph-based two-sample tests for high dimension, low sample size data ⋮ GreedyExperimentalDesign ⋮ Using the Exterior Match to Compare Two Entwined Matched Control Groups

This page was built for software: nbpMatching