Skip to content

Nanthini10/Sub-modular-Optimization

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 

Repository files navigation

Sub-modular-Optimization

  • 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.

About

Greedy and Lazy Greedy Sub Modular Optimisation

Topics

Resources

Stars

5 stars

Watchers

2 watching

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages