Nanthini10 / Sub-modular-Optimization

Greedy and Lazy Greedy Sub Modular Optimisation

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

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


Languages

Language:Python 100.0%