TY - GEN
T1 - Optimal preference elicitation for skyline queries over categorical domains
AU - Lee, Jongwuk
AU - You, Gae Won
AU - Hwang, Seung Won
AU - Selke, Joachim
AU - Balke, Wolf Tilo
PY - 2008
Y1 - 2008
N2 - When issuing user-specific queries, users often have a vaguely defined information need. Skyline queries identify the most "interesting" objects for users' incomplete preferences, which provides users with intuitive query formulation mechanism. However, the applicability of this intuitive query paradigm suffers from a severe drawback. Incomplete preferences on domain values can often lead to impractical skyline result sizes. In particular, this challenge is more critical over categorical domains. This paper addresses this challenge by developing an iterative elicitation framework. While user preferences are collected at each iteration, the framework aims to both minimize user interaction and maximize skyline reduction. The framework allows to identify a reasonably small and focused skyline set, while keeping the query formulation still intuitive for users. All that is needed is answering a few well-chosen questions. We perform extensive experiments to validate the benefits of our strategy and prove that a few questions are enough to acquire a desired manageable skyline set.
AB - When issuing user-specific queries, users often have a vaguely defined information need. Skyline queries identify the most "interesting" objects for users' incomplete preferences, which provides users with intuitive query formulation mechanism. However, the applicability of this intuitive query paradigm suffers from a severe drawback. Incomplete preferences on domain values can often lead to impractical skyline result sizes. In particular, this challenge is more critical over categorical domains. This paper addresses this challenge by developing an iterative elicitation framework. While user preferences are collected at each iteration, the framework aims to both minimize user interaction and maximize skyline reduction. The framework allows to identify a reasonably small and focused skyline set, while keeping the query formulation still intuitive for users. All that is needed is answering a few well-chosen questions. We perform extensive experiments to validate the benefits of our strategy and prove that a few questions are enough to acquire a desired manageable skyline set.
UR - http://www.scopus.com/inward/record.url?scp=52949088679&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52949088679&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-85654-2_51
DO - 10.1007/978-3-540-85654-2_51
M3 - Conference contribution
AN - SCOPUS:52949088679
SN - 3540856536
SN - 9783540856535
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 610
EP - 624
BT - Database and Expert Systems Applications - 19th International Conference, DEXA 2008, Proceedings
T2 - 19th International Conference on Database and Expert Systems Applications, DEXA 2008
Y2 - 1 September 2008 through 5 September 2008
ER -