nbpMatching: Functions for Optimal Non-Bipartite Matching
Version 1.5.1

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

Package details

AuthorCole Beck [aut, cre], Bo Lu [aut], Robert Greevy [aut]
Date of publication2016-04-18 22:37:08
MaintainerCole Beck <cole.beck@vanderbilt.edu>
LicenseGPL (>= 2)
Version1.5.1
URL http://biostat.mc.vanderbilt.edu/wiki/Main/MatchedRandomization
Package repositoryView on R-Forge
Installation Install the latest version of this package by entering the following in R:
install.packages("nbpMatching", repos="http://R-Forge.R-project.org")

Try the nbpMatching package in your browser

Any scripts or data that you put into this service are public.

nbpMatching documentation built on May 31, 2017, 3:25 a.m.