Git Product home page Git Product logo

ultimatch's Introduction

ultimatch: counterfactual matching

ultimatch implements various score and distance based matching methods, i.e. Nearest Neighbor, Radius, Coarsened Exact, Percentile Rank and Mahalanobis and Euclidean Distance Matching. It implements an efficient method for distance based matching preventing the inflationary increment of the runtime. Matched observations are marked individually allowing interactions between treated and counterfactuals. Different methods can be combined to improve the results and/or to impose external requirements on the matched. Among other control variables, it creates mandatory weights to provide balanced matching results, preventing distortions caused by skewed counterfactual candidate distributions, e.g. overabundance of candidates with the same score or within the same coarsened group. It can be used to identify geographic neighborhood relations.

Prerequisites

STATA

Getting started

  • Copy ultimatch.ado and ultimatch.sthlp into your ADO file directory (typically c:\ado).
  • Call the help file within STATA: help ultimatch.
  • Copy the provided examples from the help document into do-files and run them.
  • Adjust the templates in the examples to your needs until you you get the hang of it.

Version history

2021.02.02

  • Distance-based matching now supports the draw option.
  • Matching results can be reproduced with set seed.
  • Fixed a bug in score-based matching regarding the combination of copy and single.

2020.05.19

  • Small adjustments to the help file.

2020.03.06

  • The reported means are displayed as rounded numbers (9th digit after the comma).

2020.01.22

  • Optimized the calculation of the outside reference point for the hypersphere leeway algorithm.

2019.09.10

  • Implemented Standardized Differences in Means (SDM) as additional similarity measurement.
  • Non-Clustered standard errors are now robust.

2019.08.31

  • Prevent the usage of the options limit and exp for Coarsened Exact matching.

2019.08.26

  • Fixed a bug in Mahalanobis matching that caused partially greedy behavior in non-greedy mode.
  • Included options euclid and mahalamobis to improve flexibility for distance matching.
  • Included option full as sub-option to copy to enforce treated/counterfactual tuples.
  • Included option radius to explicitly activate radius matching instead of the implicit activation before.
  • Percentile Rank is now considered a general transformation instead of a separate matching method.
  • ultimatch now supports radius matching for the distance-based matching method.
  • Added an additional example.

2019.04.25 (ssc repository version)

  • Initial version.

Author

  • Thorsten Doherr - ZEW

ultimatch's People

Contributors

thorstendoherr avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar

Watchers

 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.