Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

K-nearest neighbor matching for ATE and missing match.matrix #198

Open
lena-222 opened this issue Jul 23, 2024 · 2 comments
Open

K-nearest neighbor matching for ATE and missing match.matrix #198

lena-222 opened this issue Jul 23, 2024 · 2 comments

Comments

@lena-222
Copy link

Hello guys,

thanks for the great package. I've been using it for matching. However, the K-nearest neighbor matching for ATE would be a good extension for being able to compare different matching algorithms. For the other matching versions the object match.matrix is not available.

Both would be good extensions if it's something you have the capacity for!
Thanks a lot for the good package
Lena

@ngreifer
Copy link
Collaborator

Thanks for the suggestion. This is going to be implemented in a major update to MatchIt that hopefully will occur later this year or early next year. Note, though, that standard error estimation for this method is not well understood outside of the context of matching imputation as described by Abadie and Imbens (2006) and implemented in the Matching package. Matching provides an accurate standard error estimator for the ATE when matching with replacement, so for now, I recommend using it instead of MatchIt if you are set on using this method. Otherwise, subclassification, optimal full matching, and generalized full matching can be good alternatives. They don't have a match.matrix because they don't involve create pairs; rather, they form subclasses.

@lena-222
Copy link
Author

lena-222 commented Jul 23, 2024 via email

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants