Functions for Optimal Matching
Specify a matching problem where units in a common factor cannot be ma...
Convert an object to InfinitySparseMatrix
Splits a BlockedInfinitySparseMatrix into a list of InfinitySparseMatr...
Blocked Infinity Sparse Matrix
Combine Optmatch objects
Prepare matching distances suitable for matching within calipers.
(Internal) Determines how many other units fall within a caliper dista...
(Internal) Returns a reasonable upper bound on the arcs remaining afte...
Combine InfinitySparseMatrices or BlockedInfinitySparseMatrices by row...
Compares the equality of optmatch objects, ignoring attributes and gro...
Diagonally bind together subgroup-specific distances
Get and set dimnames for InfinitySparseMatrix objects
Combine multiple distance specifications into a single distance specif...
Create EdgeList object
Compute the effective sample size of a match.
Compute value of primal problem given flows and arc costs
Generate an exact matching set of subproblems.
Create missingness indicator variables and non-informatively fill in m...
List subproblems of a distance
(Internal) A helper function to turn formulas into treatment and block...
Optimal full matching
What is the maximum allowed problem size?
(Internal) Hashing functions for various distance objects #
Objects for sparse matching problems.
Subsetting for InfinitySparseMatrices
Element-wise addition
(Internal) Helper function for accessing algorithms in LEMON solver
(Internal) Create optmatch objects, the result of matching.
pooled dispersion for a numeric variable
Create treated to control distances for matching problems
Determine distances between matched units
Identification of units placed into matched sets
Find the maximum caliper width that will create a feasible problem.
Combine objects
(Deprecated, in favor of match_on) Create matching distances
Find the minimal exact match factors that will be feasible for a given...
Set thinning and thickening caps for full matching
(Internal) If the x argument does not exist for match_on, fullmatch, o...
This method quells a warning when optmatch::scores()is applied to a ...
Returns the number of eligible matches for the distance.
optmatch_restrictions
Checks if two distances are equivalent. x and y can be distances (...
Functions deprecated or removed from optmatch
Optmatch Class
Optimal 1:1 and 1:k matching
(Internal) Predict for CBPS objects
Printing optmatch objects.
Reset implicit node labels of an ArcInfo object
(Internal) Helper function to create an InfinitySparseMatrix from a se...
Extract scores (propensity, prognostic,...) from a fitted model
(Internal) Sets up the default values for maximum feasible problems
Set the maximum problem size
(Internal) Sets up option to try recovery in fullmatch.
Displays a BlockedInfinitySparseMatrix
Displays an InfinitySparseMatrix
Sort the internal structure of an InfinitySparseMatrix.
pooled dispersion for a numeric variable
Identify Stratafication Variables
Return structure of matched sets
Returns the dimension of each valid subproblem
(Internal) Report successful subproblems.
Summarize a distance matrix
Performs an update on an optmatch object.
(Internal) Validate that objects are valid distance specifications.
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.
Useful links