ACM Home Page
Please provide us with feedback. Feedback
FlexRecs: expressing and combining flexible recommendations
Full text PdfPdf (805 KB)
Source
International Conference on Management of Data archive
Proceedings of the 35th SIGMOD international conference on Management of data table of contents
Providence, Rhode Island, USA
SESSION: Research session 19: semi-structured data management table of contents
Pages 745-758  
Year of Publication: 2009
ISBN:978-1-60558-551-2
Authors
Georgia Koutrika  Stanford University, Stanford, California, USA
Benjamin Bercovitz  Stanford University, Stanford, California, USA
Hector Garcia-Molina  Stanford University, Stanford, California, USA
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 47,   Downloads (12 Months): 208,   Citation Count: 0
Additional Information:

abstract   references   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/1559845.1559923
What is a DOI?

ABSTRACT

Recommendation systems have become very popular but most recommendation methods are `hard-wired' into the system making experimentation with and implementation of new recommendation paradigms cumbersome. In this paper, we propose FlexRecs, a framework that decouples the definition of a recommendation process from its execution and supports flexible recommendations over structured data. In FlexRecs, a recommendation approach can be defined declaratively as a high-level parameterized workflow comprising traditional relational operators and new operators that generate or combine recommendations. We describe a prototype flexible recommendation engine that realizes the proposed framework and we present example workflows and experimental results that show its potential for capturing multiple, existing or novel, recommendations easily and having a flexible recommendation system that combines extensibility with reasonable performance.


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
Problems with recommendations: url: http://www.amazon.com/problemswith-kindle-store-recommendations/forum/fxbvkst06pwp9b/tx1togp7gq4xa4t/1?_encoding=utf8&asin=b000fi73ma.
 
2
The Stanford Daily: url: http://stanforddaily.com/article/2007/12/5/-editorialcourserankalongoverduesuccess.
 
3
 
4
 
5
6
 
7
 
8
J. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In 14th UAI Conf., 1998.
 
9
10
 
11
V. Deshpande and P. Larson. Transforming from flat algebra to nested algebra. System Sciences, 2(2-5):298--307, 1990.
12
13
14
15
 
16
 
17
18
19
20
 
21
22
23
24
 
25
 
26
 
27
B. Sheth and P. Maes. Evolving agents for personalized information filtering. In IEEE Conf. Artificial Intelligence for Applications, 1993.

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