-
Notifications
You must be signed in to change notification settings - Fork 14
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
different calipers for different subproblems #197
Labels
Comments
|
My current solution is to side step combining matrices by combining matched objects:
|
Leaving this open just in case it is useful. |
benthestatistician
changed the title
User-style help: different calipers for different subproblems.
different calipers for different subproblems
Feb 13, 2021
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hi all,
I have a design with 12 subproblems. The best calipers differ by subproblems (we have more and easier to match people near Kano, Nigeria than in the Northeastern part of the country). My inspection of the code suggests that while arguments to
fullmatch
likemin.controls
can take names of of the subproblems but thatcaliper
cannot.I could apply calipers to each subproblem in the list created by
findSubproblems(d)
(whered
arises frommatch_on
andexactmatch
), but then I have a list of matrices rather than an object I can offer tofullmatch
.Should this then be a two step process:
mat_lst <- lapply(subproblemids,function(id){ d_lst[[id]] + caliper(d_lst[[id]],thecalipers[[id]]) })
Assuming that the rownames of the original data are carried correctly from the data to
d
(bymatch_on
) and then to the subproblems byfindSubproblems
:Is this right? Or is there another approach you have taken or envision which is more in line with how you manage vector-valued arguments to
fullmatch
?The text was updated successfully, but these errors were encountered: