linear_assignment can now be imported from scipy
See original GitHub issuesklearn.utils.linear_assignment_
can be replaced by scipy.optimize.linear_sum_assignment
now that scipy >= 0.17 is required by scikit-learn.
The sklearn.utils.linear_assignment_
module should be deprecated to be removed in 0.23 (assuming this issue gets fixed before 0.21’s release).
Issue Analytics
- State:
- Created 5 years ago
- Comments:7 (5 by maintainers)
Top Results From Across the Web
No module named 'sklearn.utils.linear_assignment_'
from scipy.optimize import linear_sum_assignment as linear_assignment. then you can run the file and don't need to change the code.
Read more >scipy.optimize.linear_sum_assignment — SciPy v1.9.3 Manual
An array of row indices and one of corresponding column indices giving the optimal assignment. The cost of the assignment can be computed...
Read more >SciPy 1.4.0 Release Notes — SciPy v1.9.3 Manual
Documentation can now be built with runtests.py --doc ... will unconditionally refer to the NumPy version regardless of whether scipy.special is imported.
Read more >SciPy 1.7.0 Release Notes — SciPy v1.9.3 Manual
Our development attention will now shift to bug-fix releases on the 1.7.x branch, and on adding ... #13236: MAINT: reorganize shared linear assignment...
Read more >SciPy 1.6.0 Release Notes — SciPy v1.9.3 Manual
Our development attention will now shift to bug-fix releases on the 1.6.x branch, ... also known as the linear assignment problem, has been...
Read more >Top Related Medium Post
No results found
Top Related StackOverflow Question
Troubleshoot Live Code
Lightrun enables developers to add logs, metrics and snapshots to live code - no restarts or redeploys required.
Start FreeTop Related Reddit Thread
No results found
Top Related Hackernoon Post
No results found
Top Related Tweet
No results found
Top Related Dev.to Post
No results found
Top Related Hashnode Post
No results found
Top GitHub Comments
@jnhansen @praths007 I am concerned that
linear_sum_assignment
is not equivalent tolinear_assignment
which later implements “maximum values” matching strategy not “complete matching” strategy, i.e. in tracking problem maybe an old landmark lost and a new detection coming in. We don’t have to make a complete assignment, just match as more as possible.I also try to tell others that it is dangerous to use linear_sum_assignment because it implements complete matching, where in the most cases we don’t need.
Instead of using complete matching by KM algorithms, mini cut - max flow might be a good choice.
Resolved in #13465