Recommendations with prerequisites

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. Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]]: Information Search and Retrieval—Information Filtering General Terms Algorithms, Experimentation, Theory Keywords Recommendation Algorithms, Graph Theory

• Type: Conference
• Year: 2009
• Where: RECSYS
• Authors: Aditya G. Parameswaran, Hector Garcia-Molina
• Keywords: Control Systems, Course ‘real Analysis, General Terms Algorithms, Keywords Recommendation Algorithms, RECSYS 2009