Recommendation systems aim to identify items that are likely to be of interest to users. In many cases, users are interested in package recommendations as collections of items. For example, a dietitian may wish to derive a dietary plan as a collection of recipes that is nutritionally balanced, and a travel agent may want to produce a vacation package as a coordinated collection of travel and hotel reservations. Recent work has explored extending recommendation systems to support packages of items. These systems need to solve complex combinatorial problems, enforcing various properties and constraints defined on sets of items. Introducing constraints on packages makes recommendation queries harder to evaluate, but also harder to express: Queries that are under-specified produce too many answers, whereas queries that are over-specified frequently miss interesting solutions.
In this paper, we study query relaxation techniques that target package recommendation systems. Our work offers three key insights: First, even when the original query result is not empty, relaxing constraints can produce preferable solutions. Second, a solution due to relaxation can only be preferred if it improves some property specified by the query. Third, relaxation should not treat all constraints as equals: some constraints are more important to the users than others. Our contributions are threefold: (a) we define the problem of deriving package recommendations through query relaxation, (b) we design and experimentally evaluate heuristics that relax query constraints to derive interesting packages, and (c) we present a crowd study that evaluates the sensitivity of real users to different kinds of constraints and demonstrates that query relaxation is a powerful tool in diversifying package recommendations.
[1]
Wenfei Fan,et al.
On the Complexity of Package Recommendation Problems
,
2013
.
[2]
Aditya G. Parameswaran,et al.
Recommendation systems with complex constraints: A course recommendation perspective
,
2011,
TOIS.
[3]
Cong Yu,et al.
Constructing and exploring composite items
,
2010,
SIGMOD Conference.
[4]
Georgia Koutrika,et al.
A survey on representation, composition and application of preferences in database systems
,
2011,
TODS.
[5]
Theodoros Lappas,et al.
Finding a team of experts in social networks
,
2009,
KDD.
[6]
Aditya G. Parameswaran,et al.
Evaluating, combining and generalizing recommendations with prerequisites
,
2010,
CIKM.
[7]
Alexandra Meliou,et al.
PackageBuilder: From Tuples to Packages
,
2014,
Proc. VLDB Endow..
[8]
Luca Becchetti,et al.
Power in unity: forming teams in large-scale community systems
,
2010,
CIKM.
[9]
Anthony K. H. Tung,et al.
Relaxing join and selection queries
,
2006,
VLDB.
[10]
Xi Zhang,et al.
Preference queries over sets
,
2011,
2011 IEEE 27th International Conference on Data Engineering.
[11]
Surajit Chaudhuri.
Generalization and a framework for query modification
,
1990,
[1990] Proceedings. Sixth International Conference on Data Engineering.
[12]
Guoping Wang,et al.
Evaluation of set-based queries with aggregation constraints
,
2011,
CIKM '11.
[13]
Laks V. S. Lakshmanan,et al.
Breaking out of the box of recommendations: from items to packages
,
2010,
RecSys '10.
[14]
Gautam Das,et al.
On Skyline Groups
,
2012,
IEEE Transactions on Knowledge and Data Engineering.