Parameswaran, Aditya and Garcia-Molina, Hector (2009) Recommendations with prerequisites. Technical Report. Stanford InfoLab.
![[img]](/style/images/fileicons/application_pdf.png)  Preview |
| PDF
395Kb |
Abstract
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: | Techreport (Technical Report) |
|---|
| Uncontrolled Keywords: | Recommendation Algorithms, Graph Theory, Algorithms, Theory |
|---|
| Projects: | CourseRank |
|---|
| ID Code: | 920 |
|---|
| Deposited By: | Aditya Parameswaran |
|---|
| Deposited On: | 10 May 2009 13:41 |
|---|
| Last Modified: | 30 Nov 2009 01:34 |
|---|
Available Versions of this Item
- Recommendations with prerequisites. (deposited 10 May 2009 13:41) [Currently Displayed]
Download statistics
Repository Staff Only: item control page
