Hi Chris,
Cool! I will try it very soon!!
Thank you
Roberto
On 2 April 2018 at 01:47, Chris Aridas wrote:
> Hi Roberto,
>
> One option it could be to make a wrapper and serialize your pipeline in
> your wrapper's fit method.
> After the serialization you could load the pipeline anytime and ins
Matching to minimize a cost is known as the linear assignment problem,
can be solved in n^3 cost, and is implemented in scikit-learn in
sklearn.utils.linear_assignment_.linear_assignment or in recent versions
of scipy as scipy.optimize.linear_sum_assignment
Of course, this problem will require muc
Thanks Dr. Varoquax, it’s awesome you’re on this list, I’m a fan of your
work!
Will look into this strategy.
Best,
Randy
On Tue, Apr 3, 2018 at 8:57 AM Gael Varoquaux
wrote:
> Matching to minimize a cost is known as the linear assignment problem,
> can be solved in n^3 cost, and is implemente
Hi Dr. Varoquaux,
It seems like the SciPy function only assigns one row to one column. I need
to assign 20 controls to each case. Does the linear_sum_assignment
function, since it assigns unique pairs, depend on the order of the rows
and columns? If so, perhaps I could shuffle and then combine the