forked from PySATL/pysatl-mpest
-
Notifications
You must be signed in to change notification settings - Fork 0
Description
The current version of the module is not suitable for several reasons:
- Duplicate code for various scoring functions (AIC, BIC, Likelihood)
- A full enumeration does not take into account components of the same family.
- The greedy algorithm can be implemented using the Hungarian algorithm in O(n^3)
To resolve this issue, all sub-issues must be completed. Before starting work on it, please describe the architectural solution and discuss it with me.
The result of this task should be:
- Three cluster matching strategies implemented: Greedy, Hugarian, and brute force.
- The ability to select a score function for cluster matching strategies.
Sub-issues
Metadata
Metadata
Assignees
Labels
No labels