TY - GEN
T1 - Recommendations with prerequisites
AU - Parameswaran, Aditya G.
AU - Garcia-Molina, Hector
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
KW - Graph theory
KW - Recommendation algorithms
UR - http://www.scopus.com/inward/record.url?scp=72249101703&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=72249101703&partnerID=8YFLogxK
U2 - 10.1145/1639714.1639786
DO - 10.1145/1639714.1639786
M3 - Conference contribution
AN - SCOPUS:72249101703
SN - 9781605584355
T3 - RecSys'09 - Proceedings of the 3rd ACM Conference on Recommender Systems
SP - 353
EP - 356
BT - RecSys'09 - Proceedings of the 3rd ACM Conference on Recommender Systems
T2 - 3rd ACM Conference on Recommender Systems, RecSys'09
Y2 - 23 October 2009 through 25 October 2009
ER -