| Flexible recommendations over rich data |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 19, Downloads (12 Months): 183, Citation Count: 1
|
|
|
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
|
Abhinandan S. Das , Mayur Datar , Ashutosh Garg , Shyam Rajaram, Google news personalization: scalable online collaborative filtering, Proceedings of the 16th international conference on World Wide Web, May 08-12, 2007, Banff, Alberta, Canada
[doi> 10.1145/1242572.1242610]
|
 |
12
|
|
 |
13
|
Jonathan L. Herlocker , Joseph A. Konstan , Al Borchers , John Riedl, An algorithmic framework for performing collaborative filtering, Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, p.230-237, August 15-19, 1999, Berkeley, California, United States
[doi> 10.1145/312624.312682]
|
 |
14
|
|
 |
15
|
|
| |
16
|
|
 |
17
|
|
 |
18
|
Bradley N. Miller , Istvan Albert , Shyong K. Lam , Joseph A. Konstan , John Riedl, MovieLens unplugged: experiences with an occasionally connected recommender system, Proceedings of the 8th international conference on Intelligent user interfaces, January 12-15, 2003, Miami, Florida, USA
[doi> 10.1145/604045.604094]
|
| |
19
|
|
 |
20
|
Paul Resnick , Neophytos Iacovou , Mitesh Suchak , Peter Bergstrom , John Riedl, GroupLens: an open architecture for collaborative filtering of netnews, Proceedings of the 1994 ACM conference on Computer supported cooperative work, p.175-186, October 22-26, 1994, Chapel Hill, North Carolina, United States
[doi> 10.1145/192844.192905]
|
 |
21
|
|
| |
22
|
|
| |
23
|
B. Sheth and P. Maes. Evolving agents for personalized information filtering. In IEEE Conf. Artificial Intelligence for Applications, 1993.
|
|