nbpMatching (Q18860): Difference between revisions
From MaRDI portal
Removed claim: imports (P585): Hmisc (Q16701) |
Changed an Item |
||||||||||||||
Property / last update | |||||||||||||||
| |||||||||||||||
Property / last update: 19 April 2016 / rank | |||||||||||||||
Property / software version identifier | |||||||||||||||
1.0 | |||||||||||||||
Property / software version identifier: 1.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 1.0 / qualifier | |||||||||||||||
publication date: 18 September 2009
| |||||||||||||||
Property / software version identifier | |||||||||||||||
1.3.2 | |||||||||||||||
Property / software version identifier: 1.3.2 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 1.3.2 / qualifier | |||||||||||||||
publication date: 29 October 2012
| |||||||||||||||
Property / software version identifier | |||||||||||||||
1.3.6 | |||||||||||||||
Property / software version identifier: 1.3.6 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 1.3.6 / qualifier | |||||||||||||||
publication date: 5 November 2012
| |||||||||||||||
Property / software version identifier | |||||||||||||||
1.4.0 | |||||||||||||||
Property / software version identifier: 1.4.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 1.4.0 / qualifier | |||||||||||||||
publication date: 17 April 2013
| |||||||||||||||
Property / software version identifier | |||||||||||||||
1.4.4 | |||||||||||||||
Property / software version identifier: 1.4.4 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 1.4.4 / qualifier | |||||||||||||||
publication date: 21 January 2015
| |||||||||||||||
Property / software version identifier | |||||||||||||||
1.4.5 | |||||||||||||||
Property / software version identifier: 1.4.5 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 1.4.5 / qualifier | |||||||||||||||
publication date: 15 May 2015
| |||||||||||||||
Property / software version identifier | |||||||||||||||
1.5.0 | |||||||||||||||
Property / software version identifier: 1.5.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 1.5.0 / qualifier | |||||||||||||||
publication date: 13 January 2016
| |||||||||||||||
Property / software version identifier | |||||||||||||||
1.5.4 | |||||||||||||||
Property / software version identifier: 1.5.4 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 1.5.4 / qualifier | |||||||||||||||
publication date: 19 August 2023
| |||||||||||||||
Property / last update | |||||||||||||||
19 August 2023
| |||||||||||||||
Property / last update: 19 August 2023 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / 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()'. | |||||||||||||||
Property / 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()'. / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / author | |||||||||||||||
Property / author: Cole Beck / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / author | |||||||||||||||
Property / author: Bo Lu / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / author | |||||||||||||||
Property / author: Robert Greevy / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / copyright license | |||||||||||||||
Property / copyright license: GNU General Public License, version 2.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / copyright license | |||||||||||||||
Property / copyright license: GNU General Public License, version 3.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / copyright license: GNU General Public License, version 3.0 / qualifier | |||||||||||||||
edition/version: expanded from: GPL (≥ 2) (English) | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: methods / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: stats / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: Hmisc / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: MASS / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: utils / rank | |||||||||||||||
Normal rank |
Revision as of 17:22, 4 March 2024
Functions for Optimal Non-Bipartite Matching
Language | Label | Description | Also known as |
---|---|---|---|
English | nbpMatching |
Functions for Optimal Non-Bipartite Matching |
Statements
19 August 2023
0 references
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()'.
0 references
expanded from: GPL (≥ 2) (English)
0 references