hash_dist

hash_dist.DenseMatrix

hash_dist.matrix

hash_dist.InfinitySparseMatrix

hash_dist.BlockedInfinitySparseMatrix

hash_dist.optmatch.dlist

(Internal) Hashing functions for various distance objects
#

internal

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.

Josh Errickson

optmatch

Functions for Optimal Matching

Ben Hansen

Mark Fredrickson

Josh Buckner

Adam Rauh

hash_dist function

<dl><dt>dist</dt>
<dd>Distance object to hash. Must be one of
<code>InfinitySparseMatrix</code>, <code>BlockedInfinitySparseMatrix</code>,
<code>DenseMatrix</code>, <code>matrix</code>, or <code>distmatch.dlist</code>.</dd></dl>

Arguments

(Internal) Hashing functions for various distance objects
# — hash_dist

<dl>

<dt>dist</dt>
<dd>Distance object to hash. Must be one of
<code>InfinitySparseMatrix</code>, <code>BlockedInfinitySparseMatrix</code>,
<code>DenseMatrix</code>, <code>matrix</code>, or <code>distmatch.dlist</code>.</dd>

</dl>

(Internal) Hashing functions for various distance objects
#

hash_dist: (Internal) Hashing functions for various distance objects #

Description

Usage

Value

Arguments