Name
Abstract | ||
|---|---|---|
We study the problem of making recommendations when the objects to be recommended must also satisfy constraints or requirements. In particular, we focus on course recommendations: the courses taken by a student must satisfy requirements (e.g., take two out of a set of five math courses) in order for the student to graduate. Our work is done in the context of the CourseRank system, used by students to plan their academic program at Stanford University. Our goal is to recommend to these students courses that not only help satisfy constraints, but that are also desirable (e.g., popular or taken by similar students). We develop increasingly expressive models for course requirements, and present a variety of schemes for both checking if the requirements are satisfied, and for making recommendations that take into account the requirements. We show that some types of requirements are inherently expensive to check, and we present exact, as well as heuristic techniques, for those cases. Although our work is specific to course requirements, it provides insights into the design of recommendation systems in the presence of complex constraints found in other applications. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2037661.2037665 | ACM Trans. Inf. Syst. |
Keywords | Field | DocType |
students course,course requirement,recommendation system,complex constraint,course recommendation perspective,expressive model,stanford university,courserank system,academic program,math course,course recommendation,similar student,satisfiability,recommender systems,recommender system | Recommender system,World Wide Web,Heuristic,Information retrieval,Software engineering,Computer science | Journal |
Volume | Issue | ISSN |
29 | 4 | 1046-8188 |
Citations | PageRank | References |
52 | 1.57 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aditya Parameswaran | 1 | 1112 | 78.56 |
| Petros Venetis | 2 | 337 | 12.66 |
| Héctor García-Molina | 3 | 24359 | 5652.13 |