%0 Report %1 brusilovsky:ilprints920 %A Parameswaran, Aditya %A Garcia-Molina, Hector %B ACM Conference on Recommender Systems %D 2009 %I Stanford InfoLab %K course-recommender prerequisite recommender %T Recommendations with prerequisites %U http://ilpubs.stanford.edu:8090/920/ %X 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.

@techreport{brusilovsky:ilprints920, 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.}}, added-at = {2017-11-15T17:02:25.000+0100}, author = {Parameswaran, Aditya and Garcia-Molina, Hector}, biburl = {https://www.bibsonomy.org/bibtex/2856908f5a4214979a46867347d6be0c0/brusilovsky}, booktitle = {ACM Conference on Recommender Systems}, citeulike-article-id = {6435129}, citeulike-linkout-0 = {http://ilpubs.stanford.edu:8090/920/}, institution = {Stanford University}, interhash = {7530803f6d59a78c26a4615e92df4f22}, intrahash = {856908f5a4214979a46867347d6be0c0}, keywords = {course-recommender prerequisite recommender}, month = oct, posted-at = {2013-08-31 10:33:37}, priority = {2}, publisher = {Stanford InfoLab}, timestamp = {2018-04-18T16:43:29.000+0200}, title = {{Recommendations with prerequisites}}, type = {Technical Report}, url = {http://ilpubs.stanford.edu:8090/920/}, year = 2009 }