-
The goal of the project is to select 50 movies that have the maximum chance of being liked by the users. In order to achieve this
-
We used Sub-Modular Optimization methods - Greedy and Lazy Greedy Algorithms to demonstrate the difference in performance between the two to perform the same task.
-
Notifications
You must be signed in to change notification settings - Fork 0
Nanthini10/Sub-modular-Optimization
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Greedy and Lazy Greedy Sub Modular Optimisation
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published