Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Generating top-k packages via preference elicitation

Published: 01 October 2014 Publication History

Abstract

There are several applications, such as play lists of songs or movies, and shopping carts, where users are interested in finding top-k packages, consisting of sets of items. In response to this need, there has been a recent flurry of activity around extending classical recommender systems (RS), which are effective at recommending individual items, to recommend packages, or sets of items. The few recent proposals for package RS suffer from one of the following drawbacks: they either rely on hard constraints which may be difficult to be specified exactly by the user or on returning Pareto-optimal packages which are too numerous for the user to sift through. To overcome these limitations, we propose an alternative approach for finding personalized top-k packages for users, by capturing users' preferences over packages using a linear utility function which the system learns. Instead of asking a user to specify this function explicitly, which is unrealistic, we explicitly model the uncertainty in the utility function and propose a preference elicitation-based framework for learning the utility function through feedback provided by the user. We propose several sampling-based methods which, given user feedback, can capture the updated utility function. We develop an efficient algorithm for generating top-k packages using the learned utility function, where the rank ordering respects any of a variety of ranking semantics proposed in the literature. Through extensive experiments on both real and synthetic datasets, we demonstrate the efficiency and effectiveness of the proposed system for finding top-k packages.

References

[1]
G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. TKDE, 17(6):734--749, 2005.
[2]
A. V. Aho, M. R. Garey, and J. D. Ullman. The transitive reduction of a directed graph. J.Comp., 1(2):131--137, 1972.
[3]
C. M. Bishop. Neural Networks for Pattern Recognition. Oxford University Press, 1995.
[4]
S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421--430, 2001.
[5]
N. Botkin and V. Turova-Botkina. An algorithm for finding the chebyshev center of a convex polyhedron. Applied Mathematics and Optimization, 29(2):211--222, 1994.
[6]
C. Boutilier. A pomdp formulation of preference elicitation problems. In AAAI, pages 239--246, 2002.
[7]
G. Brewka, D. Kossmann, and K. Stocker. Representing preferences among sets. In AAAI, 2010.
[8]
Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li. Learning to rank: from pairwise approach to listwise approach. In ICML, pages 129--136, 2007.
[9]
U. Chajewska, D. Koller, and R. Parr. Making rational decisions using adaptive utility elicitation. In AAAI, pages 363--369, 2000.
[10]
J. Chomicki. Preference formulas in relational queries. ACM TODS, 28(4):427--466, 2003.
[11]
M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer, 2000.
[12]
R. A. Finkel and J. L. Bentley. Quad trees: A data structure for retrieval on composite keys. Acta Inf., 4: 1--9, 1974.
[13]
I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv., 40(4), 2008.
[14]
B. Jiang, J. Pei, X. Lin, D. W. Cheung, and J. Han. Mining preferences from superior and inferior examples. In KDD, pages 390--398, 2008.
[15]
R. L. Keeney and H. Raiffa. Decisions with Multiple Objectives: Decisions with Preferences and Value Tradeoffs. Cambridge University Press, 2003.
[16]
W. Kießling. Foundations of preferences in database systems. In VLDB, pages 311--322, 2002.
[17]
A. Kong, J. S. Liu, and W. H. Wong. Sequential imputations and bayesian missing data problems. JASA, 89(425):278--288, 1994.
[18]
G. Koutrika, B. Bercovitz, and H. Garcia-Molina. FlexRecs: expressing and combining flexible recommendations. In SIGMOD, pages 745--758, 2009.
[19]
J. J. Levandoski, M. Sarwat, M. F. Mokbel, and M. D. Ekstrand. Recstore: an extensible and adaptive framework for online recommender queries inside the database engine. In EDBT, pages 86--96, 2012.
[20]
C. Li, N. Zhang, N. Hassan, S. Rajasekaran, and G. Das. On skyline groups. In CIKM, 2012.
[21]
G. Linden, S. Hanks, and N. Lesh. Interactive assessment of user preference models: The automated travel assistant. In UM, pages 67--78, 1997.
[22]
D. Mindolin and J. Chomicki. Discovering relative importance of skyline attributes. PVLDB, 2(1):610--621, 2009.
[23]
S. B. Roy, G. Das, S. Amer-Yahia, and C. Yu. Interactive itinerary planning. In ICDE, 2011.
[24]
M. A. Soliman, I. F. Ilyas, D. Martinenghi, and M. Tagliasacchi. Ranking with uncertain scoring functions: Semantics and sensitivity measures. In SIGMOD, pages 805--816, 2011.
[25]
K. Stefanidis, G. Koutrika, and E. Pitoura. A survey on representation, composition and application of preferences in database systems. ACM TODS, 36(3):19, 2011.
[26]
O. Toubia, J. R. Hauser, and D. I. Simester. Polyhedral methods for adaptive choice-based conjoint analysis. Journal of Marketing Research, 41(1):116--131, 2004.
[27]
M. Xie, L. V. S. Lakshmanan, and P. T. Wood. Breaking out of the box of recommendations: From items to packages. In RecSys, pages 151--158. ACM, 2010.
[28]
M. Yang, H. Wang, H. Chen, and W.-S. Ku. Querying uncertain data with aggregate constraints. In SIGMOD, pages 817--828, 2011.
[29]
X. Zhang and J. Chomicki. Preference queries over sets. In ICDE, pages 1019--1030, 2011.
[30]
F. Zhao, G. Das, K.-L. Tan, and A. K. H. Tung. Call to order: A hierarchical browsing approach to eliciting users preference. In SIGMOD, pages 27--38, 2010.

Cited By

View all
  • (2024)Revisiting Bundle Recommendation for Intent-aware Product BundlingACM Transactions on Recommender Systems10.1145/36528652:3(1-34)Online publication date: 15-Mar-2024
  • (2024)Adaptive In-Context Learning with Large Language Models for Bundle GenerationProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657808(966-976)Online publication date: 10-Jul-2024
  • (2022)Interaction-aware Drug Package Recommendation via Policy GradientACM Transactions on Information Systems10.1145/351102041:1(1-32)Online publication date: 14-Feb-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment  Volume 7, Issue 14
October 2014
244 pages
ISSN:2150-8097
  • Editors:
  • H. V. Jagadish,
  • Aoying Zhou
Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 October 2014
Published in PVLDB Volume 7, Issue 14

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)15
  • Downloads (Last 6 weeks)0
Reflects downloads up to 26 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Revisiting Bundle Recommendation for Intent-aware Product BundlingACM Transactions on Recommender Systems10.1145/36528652:3(1-34)Online publication date: 15-Mar-2024
  • (2024)Adaptive In-Context Learning with Large Language Models for Bundle GenerationProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657808(966-976)Online publication date: 10-Jul-2024
  • (2022)Interaction-aware Drug Package Recommendation via Policy GradientACM Transactions on Information Systems10.1145/351102041:1(1-32)Online publication date: 14-Feb-2022
  • (2022)Enumerating Fair Packages for Group RecommendationsProceedings of the Fifteenth ACM International Conference on Web Search and Data Mining10.1145/3488560.3498432(870-878)Online publication date: 11-Feb-2022
  • (2022)Revisiting Bundle RecommendationProceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3477495.3531904(2900-2911)Online publication date: 6-Jul-2022
  • (2020)Product Bundle Identification using Semi-Supervised LearningProceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3397271.3401128(791-800)Online publication date: 25-Jul-2020
  • (2019)Personalized Bundle List RecommendationThe World Wide Web Conference10.1145/3308558.3313568(60-71)Online publication date: 13-May-2019
  • (2018)Recommending packages with validity constraints to groups of usersKnowledge and Information Systems10.1007/s10115-017-1082-954:2(345-374)Online publication date: 1-Feb-2018
  • (2018)Package queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-017-0483-427:5(693-718)Online publication date: 1-Oct-2018
  • (2017)Fairness in Package-to-Group RecommendationsProceedings of the 26th International Conference on World Wide Web10.1145/3038912.3052612(371-379)Online publication date: 3-Apr-2017

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media