ACM Home Page
Please provide us with feedback. Feedback
Flexible recommendations over rich data
Full text PdfPdf (594 KB)
Source
ACM Conference On Recommender Systems archive
Proceedings of the 2008 ACM conference on Recommender systems table of contents
Lausanne, Switzerland
POSTER SESSION: Posters table of contents
Pages 203-210  
Year of Publication: 2008
ISBN:978-1-60558-093-7
Authors
Georgia Koutrika  Stanford University, Palo Alto, CA, USA
Robert Ikeda  Stanford University, Palo Alto, CA, USA
Benjamin Bercovitz  Stanford University, Palo Alto, CA, USA
Hector Garcia-Molina  Stanford University, Palo Alto, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 178,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1454008.1454041
What is a DOI?

ABSTRACT

CourseRank is a course planning tool aimed at helping students at Stanford. Recommendations comprise an integral part of it. However, implementing existing recommendation methods leads to fixed recommendations that cannot adapt to each particular student's changing requirements and do not help exploit the full extent of the available learning opportunities at the university. In this paper, we describe the concept of a flexible recommendation workflow, i.e., a high-level description of a parameterized process for computing recommendations. The input parameters of a flexible recommendation process comprise the "knobs" that control the final output and hence generate flexible recommendations. We describe how flexible recommendations can be expressed over a relational database and we present our prototype system that allows defining and executing different, fully-parameterized, recommendation workflows over relational data. Finally, we describe a user interface in CourseRank that allows students customize recommendations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
CourseRank: url: http://courserank.stanford.edu.
 
2
The Stanford Daily: url: http://stanforddaily.com/article/2007/12/5/-editorialcourserankalongoverduesuccess.
 
3
 
4
G. Adomavicius and A. Tuzhilin. Multidimensional recommender systems: A data warehousing approach. In WELCOM, 2001.
 
5
6
7
 
8
 
9
 
10
J. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In 14th Conf. Uncertainty in Artificial Intelligence, 1998.
11
12
13
14
15
 
16
17
18
 
19
20
21
 
22
 
23
B. Sheth and P. Maes. Evolving agents for personalized information filtering. In IEEE Conf. Artificial Intelligence for Applications, 1993.


Collaborative Colleagues:
Georgia Koutrika: colleagues
Robert Ikeda: colleagues
Benjamin Bercovitz: colleagues
Hector Garcia-Molina: colleagues