BlockedInfinitySparseMatrix-class

Blocked Infinity Sparse Matrices are similar to Infinity Sparse Matrices, but they also keep track of the groups of units via an additional slot, <code>groups</code>

Distance based bipartite matching using the RELAX-IV minimum cost flow solver,
oriented to matching of treatment and control groups in observational
studies. 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.

Mark Fredrickson

optmatch

Functions for Optimal Matching

BlockedInfinitySparseMatrix-class function

<dl class="dl-horizontal">
<dt><code>groups</code></dt><dd>factor vector containing groups, with unit names as labels, when possible</dd></dl><dt><code>colnames</code></dt><dd>vector containing names for all control units. This will either be a character vector or NULL if units have no names</dd><dt><code>rownames</code></dt><dd>vector containing names for all treated units. This will either be a character vector or NULL if units have no names</dd><dt><code>cols</code></dt><dd>vector of integers corresponding to control units</dd><dt><code>rows</code></dt><dd>vector of integers corresponding to treated units</dd><dt><code>dimension</code></dt><dd>integer vector containing the number of treated and control units, in that order</dd><dt><code>call</code></dt><dd>function call used to create the <code>InfinitySparseMatrix</code></dd>

BlockedInfinitySparseMatrix-class: Blocked Infinity Sparse Matrix

Description

Arguments

Slots

See Also