CompRec-Trip: A composite recommendation system for travel planning

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 1352-1355

  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

[No Author keywords available]

Indexed keywords

FLEXIBLE PACKAGES; LOCAL INFORMATION; RATING INFORMATION; RECOMMENDATION SYSTEMS; TRAVEL PLANNING;

BUDGET CONTROL; GRAPHICAL USER INTERFACES;

RECOMMENDER SYSTEMS;

EID: 79957793658     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767954     Document Type: Conference Paper

References (8)

1. 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, vol. 17, no. 6, pp. 734-749, 2005. (Pubitemid 40860454)
2. M. Xie, L. V. S. Lakshmanan, and P. T. Wood, "Breaking out of the box of recommendations: From items to packages," in ACM RecSys, 2010, pp. 151-158.
3. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Springer, 2004.
4. C. Chekuri and M. Ṕal, "A recursive greedy algorithm for walks in directed graphs," in FOCS, 2005, pp. 245-253. (Pubitemid 44375736)
5. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," J. Comput. Syst. Sci., vol. 66, no. 4, pp. 614-656, 2003.
6. 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, pp. 35-44.
7. 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., vol. 18, no. 7, pp. 401-405, 1972.
8. J. Finger and N. Polyzotis, "Robust and efficient algorithms for rank join evaluation," in ACM SIGMOD, 2009, pp. 415-428.