Recommendations with prerequisites

Aditya G. Parameswaran, Hector Garcia-Molina

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationRecSys'09 - Proceedings of the 3rd ACM Conference on Recommender Systems
Pages353-356
Number of pages4
DOIs
StatePublished - 2009
Event3rd ACM Conference on Recommender Systems, RecSys'09 - New York, NY, United States
Duration: Oct 23 2009Oct 25 2009

Publication series

NameRecSys'09 - Proceedings of the 3rd ACM Conference on Recommender Systems

Other

Other3rd ACM Conference on Recommender Systems, RecSys'09
Country/TerritoryUnited States
CityNew York, NY
Period10/23/0910/25/09

Keywords

  • Graph theory
  • Recommendation algorithms

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Cite this