optmatch (Q20176): Difference between revisions

From MaRDI portal
Created claim: source code repository (P339): https://github.com/cran/optmatch, #quickstatements; #temporary_batch_1711027662947
Swh import (talk | contribs)
SWHID from Software Heritage
 
Property / Software Heritage ID
 
Property / Software Heritage ID: swh:1:snp:75eae0f554c5632eb09178dcfe7c2da1daf4e5e0 / rank
 
Normal rank
Property / Software Heritage ID: swh:1:snp:75eae0f554c5632eb09178dcfe7c2da1daf4e5e0 / qualifier
 
Property / Software Heritage ID: swh:1:snp:75eae0f554c5632eb09178dcfe7c2da1daf4e5e0 / qualifier
 
point in time: 2 December 2023
Timestamp+2023-12-02T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0

Latest revision as of 15:32, 21 March 2024

Functions for Optimal Matching
Language Label Description Also known as
English
optmatch
Functions for Optimal Matching

    Statements

    0 references
    0.10.6
    7 February 2023
    0 references
    0.1-6
    29 October 2005
    0 references
    0.1-7
    5 April 2006
    0 references
    0.2-1
    30 October 2006
    0 references
    0.2-2
    16 April 2007
    0 references
    0.2-3
    10 May 2007
    0 references
    0.2
    12 June 2006
    0 references
    0.3-1
    9 July 2007
    0 references
    0.3-2
    9 August 2007
    0 references
    0.3-3
    25 August 2007
    0 references
    0.3-4
    27 February 2008
    0 references
    0.3-8
    13 May 2008
    0 references
    0.3-9
    14 May 2008
    0 references
    0.4-0
    20 May 2008
    0 references
    0.4-1
    5 July 2008
    0 references
    0.5-0
    19 May 2009
    0 references
    0.6-0
    28 September 2009
    0 references
    0.6-1
    11 February 2010
    0 references
    0.7-0
    30 July 2010
    0 references
    0.7-1
    6 March 2011
    0 references
    0.7-3
    2 April 2012
    0 references
    0.7-5
    27 July 2012
    0 references
    0.8-0
    17 November 2012
    0 references
    0.8-1
    3 January 2013
    0 references
    0.8-3
    16 May 2013
    0 references
    0.9-0
    10 August 2013
    0 references
    0.9-1
    1 November 2013
    0 references
    0.9-3
    13 August 2014
    0 references
    0.9-5
    31 July 2015
    0 references
    0.9-6
    3 May 2016
    0 references
    0.9-7
    30 December 2016
    0 references
    0.9-8
    17 January 2018
    0 references
    0.9-9
    15 May 2018
    0 references
    0.9-10
    12 July 2018
    0 references
    0.9-11
    12 July 2019
    0 references
    0.9-12
    11 October 2019
    0 references
    0.9-13
    6 December 2019
    0 references
    0.9-14
    26 May 2021
    0 references
    0.9-15
    17 August 2021
    0 references
    0.9-17
    22 February 2022
    0 references
    0.10.0
    15 March 2022
    0 references
    0.10.1
    13 May 2022
    0 references
    0.10.2
    15 May 2022
    0 references
    0.10.3
    16 May 2022
    0 references
    0.10.4
    9 August 2022
    0 references
    0.10.5
    15 August 2022
    0 references
    0.10.7
    15 November 2023
    0 references
    0 references
    15 November 2023
    0 references
    Distance based bipartite matching using minimum cost flow, oriented to matching of treatment and control groups in observational studies ('Hansen' and 'Klopfer' 2006 <doi:10.1198/106186006X137047>). Routines are provided to generate distances from generalised linear models (propensity score matching), formulas giving variables on which to limit matched distances, stratified or exact matching directives, or calipers, alone or in combination.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers