Proceedings of the 17th International Conference on Data Engineering
Making Rational Decisions Using Adaptive Utility Elicitation
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A POMDP formulation of preference elicitation problems
Eighteenth national conference on Artificial intelligence
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Optimization of relational preference queries
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Preference elicitation for interface optimization
Proceedings of the 18th annual ACM symposium on User interface software and technology
Algorithms and analyses for maximal vector computation
The VLDB Journal — The International Journal on Very Large Data Bases
Towards multidimensional subspace skyline analysis
ACM Transactions on Database Systems (TODS)
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Preference SQL: design, implementation, experiences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient skyline computation over low-cardinality domains
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Mining preferences from superior and inferior examples
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Introducing variable importance tradeoffs into CP-nets
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Skyline queries with constraints: Integrating skyline and traditional query operators
Data & Knowledge Engineering
Call to order: a hierarchical browsing approach to eliciting users' preference
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Regret-minimizing representative databases
Proceedings of the VLDB Endowment
Efficient skyline evaluation over partially ordered domains
Proceedings of the VLDB Endowment
Modeling the propagation of user preferences
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Interactive regret minimization
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Composition and efficient evaluation of context-aware preference queries
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
IPS: an interactive package configuration system for trip planning
Proceedings of the VLDB Endowment
Monochromatic and bichromatic mutual skyline queries
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
Querying databases with preferences is an important research problem. Among various approaches to querying with preferences, the skyline framework is one of the most popular. A well known deficiency of that framework is that all attributes are of the same importance in skyline preference relations. Consequently, the size of the results of skyline queries may grow exponentially with the number of skyline attributes. Here we propose the framework called p-skylines which enriches skylines with the notion of attribute importance. It turns out that incorporating relative attribute importance in skylines allows for reduction in the corresponding query result sizes. We propose an approach to discovering importance relationships of attributes, based on user-selected sets of superior and inferior examples. We show that the problem of checking the existence of and the problem of computing an optimal p-skyline preference relation covering a given set of examples are NP-complete and FNP-complete, respectively. However, we also show that a restricted version of the discovery problem -- using only superior examples to discover attribute importance -- can be solved efficiently in polynomial time. Our experiments show that the proposed importance discovery algorithm has high accuracy and good scalability.