Improve the Maximal Mixed-Drive Co-occurrence Patterns Mining Algorithm
Budget: $25 – $125 USD
I am seeking an experienced developer to enhance the efficiency of a Maximal Mixed-Drive Co-occurrence Patterns mining algorithm. The task involves implementing improvements detailed in the attached research paper. Specifically, the improvement should involve utilizing Bounding Boxes for identifying instances, as outlined in the paper. The current code is also attached.
Requirements:
-Proficiency in algorithm optimization.
-Experience with data structures and algorithms, especially in pattern mining.
-Ability to integrate Bounding Boxes for instance identification.
-Strong knowledge of Python and relevant libraries.
Attachments:
-Current algorithm code.
-Research paper explaining the improvement.
Project Scope:
-Review and understand the existing code and research paper.
-Implement the Bounding Box-based instance identification improvement.
-Ensure the optimized algorithm maintains or improves its accuracy and efficiency.
Requirements:
-Proficiency in algorithm optimization.
-Experience with data structures and algorithms, especially in pattern mining.
-Ability to integrate Bounding Boxes for instance identification.
-Strong knowledge of Python and relevant libraries.
Attachments:
-Current algorithm code.
-Research paper explaining the improvement.
Project Scope:
-Review and understand the existing code and research paper.
-Implement the Bounding Box-based instance identification improvement.
-Ensure the optimized algorithm maintains or improves its accuracy and efficiency.