You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
i am using matchit to calculate propensity scores for large data (say approx ~ 500 thousand records) it is taking approx 2 hours to get results. it will be great if this package support muticore parallel processing i.e., using all available cores in processor, so that computation time can be reduced significantly.
The text was updated successfully, but these errors were encountered:
This is something we will look into, but it is not straightforward how to make nearest neighbor matching without replacement run in parallel. It is an iterative process where each step depends on the steps taken before it. This makes it not "embarrassingly parallel". This may be possible with matching with replacement, however. We will continue to examine this.
i am using matchit to calculate propensity scores for large data (say approx ~ 500 thousand records) it is taking approx 2 hours to get results. it will be great if this package support muticore parallel processing i.e., using all available cores in processor, so that computation time can be reduced significantly.
The text was updated successfully, but these errors were encountered: