nbpMatching

From MaRDI portal
Software:18860



swMATH6785CRANnbpMatchingMaRDI QIDQ18860FDOQ18860

Functions for Optimal Non-Bipartite Matching

Bo Lu, Cole Beck, Robert Greevy

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

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()'.




Cited In (22)


This page was built for software: nbpMatching