CRAN

optmatch 0.9-10

Functions for Optimal Matching

Released Jul 12, 2018 by Mark M. Fredrickson

This package can be loaded by Renjin but 25 out 299 tests failed.

Dependencies

Rcpp digest 0.6.15 RItools 0.1-16 survival 2.42-6

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.

Installation

Maven

This package can be included as a dependency from a Java or Scala project by including the following your project's pom.xml file. Read more about embedding Renjin in JVM-based projects.

<dependencies>
  <dependency>
    <groupId>org.renjin.cran</groupId>
    <artifactId>optmatch</artifactId>
    <version>0.9-10-b1</version>
  </dependency>
</dependencies>
<repositories>
  <repository>
    <id>bedatadriven</id>
    <name>bedatadriven public repo</name>
    <url>https://nexus.bedatadriven.com/content/groups/public/</url>
  </repository>
</repositories>

View build log

Renjin CLI

If you're using Renjin from the command line, you load this library by invoking:

library('org.renjin.cran:optmatch')

Test Results

This package was last tested against Renjin 0.9.2657 on Aug 18, 2018.

Source

C++

Fortran

View GitHub Mirror