nbpMatching (Q18860): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Removed claim: imports (P585): Hmisc (Q16701)
Swh import (talk | contribs)
SWHID from Software Heritage
 
(3 intermediate revisions by 3 users not shown)
Property / last update
19 April 2016
Timestamp+2016-04-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
 
Property / last update: 19 April 2016 / rank
Normal 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
Timestamp+2009-09-18T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
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
Timestamp+2012-10-29T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
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
Timestamp+2012-11-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
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
Timestamp+2013-04-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
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
Timestamp+2015-01-21T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
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
Timestamp+2015-05-15T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
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
Timestamp+2016-01-13T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
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
Timestamp+2023-08-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / last update
 
19 August 2023
Timestamp+2023-08-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
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
Property / source code repository
 
Property / source code repository: https://github.com/cran/nbpMatching / rank
 
Normal rank
Property / Software Heritage ID
 
Property / Software Heritage ID: swh:1:snp:79576d3a14d0c52c83e117c6a447d645076a550a / rank
 
Normal rank
Property / Software Heritage ID: swh:1:snp:79576d3a14d0c52c83e117c6a447d645076a550a / qualifier
 
Property / Software Heritage ID: swh:1:snp:79576d3a14d0c52c83e117c6a447d645076a550a / qualifier
 
point in time: 14 September 2023
Timestamp+2023-09-14T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:58, 21 March 2024

Functions for Optimal Non-Bipartite Matching
Language Label Description Also known as
English
nbpMatching
Functions for Optimal Non-Bipartite Matching

    Statements

    0 references
    1.5.1
    19 April 2016
    0 references
    1.0
    18 September 2009
    0 references
    1.3.2
    29 October 2012
    0 references
    1.3.6
    5 November 2012
    0 references
    1.4.0
    17 April 2013
    0 references
    1.4.4
    21 January 2015
    0 references
    1.4.5
    15 May 2015
    0 references
    1.5.0
    13 January 2016
    0 references
    1.5.4
    19 August 2023
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers