Stanford InfoLab Publication Server

Recommendations with prerequisites

Parameswaran, Aditya and Garcia-Molina, Hector (2009) Recommendations with prerequisites. In: ACM Conference on Recommender Systems, Oct 22-25, 2009, New York.


This is the latest version of this item.



We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Analysis’ is a prerequisite of ‘Complex Analysis’). Since this problem is NP-hard, we develop 3 approximate algorithms to solve this problem. We experimentally evaluate these algorithms on synthetic data.

Item Type:Conference or Workshop Item (Poster)
Uncontrolled Keywords:Recommendation Algorithms, Graph Theory, Algorithms, Theory
ID Code:938
Deposited By:Aditya Parameswaran
Deposited On:11 Aug 2009 17:18
Last Modified:30 Nov 2009 01:34

Available Versions of this Item

Download statistics

Repository Staff Only: item control page