Breaking out of the box of recommendations: From items to packages

RecSys'10 - Proceedings of the 4th ACM Conference on Recommender Systems

Volumn , Issue , 2010, Pages 151-158

  Xie, Min ^a   Lakshmanan, Laks V S ^a   Wood, Peter T ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Optimization; Recommendation algorithms; Top k query processing

Indexed keywords

APPROXIMATION QUALITY; DIFFERENT DOMAINS; EMPIRICAL ANALYSIS; EXACT ALGORITHMS; INFORMATION SOURCES; NP COMPLETE; RECOMMENDATION ALGORITHMS; RECOMMENDER SYSTEMS; SYNTHETIC DATASETS; TOP-K QUERY PROCESSING; TOTAL COSTS; TRAVEL PLANNING;

BUDGET CONTROL; COSTS; INFORMATION RETRIEVAL; OPTIMIZATION; PACKAGING; QUERY PROCESSING;

APPROXIMATION ALGORITHMS;

EID: 78649976793     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1864708.1864739     Document Type: Conference Paper

References (20)

1. http://www.cs.ubc.ca/~minxie/TR-2010-04.pdf.
2. G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE TKDE, 17(6):734-749, 2005.
3. A. Angel, S. Chaudhuri, G. Das, and N. Koudas. Ranking objects based on relationships and fixed associations. In EDBT, pages 910-921, 2009.
4. A. Brodsky, S. M. Henshaw, and J. Whittle. CARD: a decision-guidance framework and application for recommending composite alternatives. In RecSys, pages 171-178, 2008.
5. M. De Choudhury, M. Feldman, S. Amer-Yahia, N. Golbandi, R. Lempel, and C. Yu. Automatic construction of travel itineraries using social breadcrumbs. In ACM Hypertext, 2010.
6. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614-656, 2003.
7. J. Finger and N. Polyzotis. Robust and efficient algorithms for rank join evaluation. In ACM SIGMOD, pages 415-428, 2009.
8. O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM, 22(4):463-468, 1975.
9. K. Järvelin and J. Kekäläinen. Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst., 20(4):422-446, 2002.
10. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
11. B. Kimelfeld and Y. Sagiv. Finding and approximating top-k answers in keyword proximity search. In PODS, pages 173-182, 2006.
12. G. Koutrika, B. Bercovitz, and H. Garcia-Molina. FlexRecs: expressing and combining flexible recommendations. In SIGMOD, pages 745-758, 2009.
13. T. Lappas, K. Liu, and E. Terzi. Finding a team of experts in social networks. In KDD, pages 467-476, 2009.
14. E. L. Lawler. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Man. Sci., 18(7):401-405, 1972.
15. A. Marchetti-Spaccamela and C. Vercellis. Stochastic on-line knapsack problems. Math. Program., 68:73-104, 1995.
16. A. Parameswaran and H. Garcia-Molina. Recommendations with prerequisites. In ACM Recommender Systems, pages 353-356, 2009.
17. A. Parameswaran, P. Venetis, and H. Garcia-Molina. Recommendation systems with complex constraints: A CourseRank perspective. Technical report, 2009.
18. S. B. Roy, S. Amer-Yahia, A. Chawla, G. Das, and C. Yu. Constructing and exploring composite items. In ACM SIGMOD, 2010.
19. V. V. Vazirani. Approximation Algorithms. Springer, 2001.
20. J. Weng, E.-P. Lim, J. Jiang, and Q. He. TwitterRank: finding topic-sensitive influential twitterers. In WSDM, pages 261-270, 2010.