CRAN

approxmatch 1.0

Approximately Optimal Fine Balance Matching with Multiple Groups

Released Nov 5, 2017 by Bikram Karmakar

Tools for constructing a matched design with multiple comparison groups. Further specifications of refined covariate balance restriction and exact match on covariate can be imposed. Matches are approximately optimal in the sense that the cost of the solution is at most twice the optimal cost, Crama and Spieksma (1992) .

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>approxmatch</artifactId>
    <version>1.0-b8</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:approxmatch')

Test Results

This package was last tested against Renjin 0.9.2687 on Aug 24, 2018.

• Dodgeram-examples
• covbalance-examples
• kwaymatching-examples
• multigrp_dist_struc-examples

Source

View GitHub Mirror

Release History

• 1.0