nbpMatching: Functions for Optimal Non-Bipartite Matching

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

Version: 1.4.5
Depends: methods, Hmisc
Imports: MASS
Suggests: testthat
Published: 2015-05-15
Author: Cole Beck [aut, cre], Bo Lu [aut], Robert Greevy [aut]
Maintainer: Cole Beck <cole.beck at vanderbilt.edu>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
URL: http://biostat.mc.vanderbilt.edu/wiki/Main/MatchedRandomization
NeedsCompilation: yes
CRAN checks: nbpMatching results

Downloads:

Reference manual: nbpMatching.pdf
Package source: nbpMatching_1.4.5.tar.gz
Windows binaries: r-devel: nbpMatching_1.4.5.zip, r-release: nbpMatching_1.4.5.zip, r-oldrel: nbpMatching_1.4.5.zip
OS X Snow Leopard binaries: r-release: nbpMatching_1.4.5.tgz, r-oldrel: nbpMatching_1.4.5.tgz
OS X Mavericks binaries: r-release: nbpMatching_1.4.5.tgz
Old sources: nbpMatching archive

Reverse dependencies:

Reverse depends: crossmatch
Reverse suggests: blockTools, hamlet