Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Finding Interesting Associations without Support Pruning
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 17th International Conference on Data Engineering
Estimating Rarity and Similarity over Data Stream Windows
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Efficient processing of top-k dominating queries on multi-dimensional data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Novelty and diversity in information retrieval evaluation
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
SkyGraph: an algorithm for important subgraph discovery in relational graphs
Data Mining and Knowledge Discovery
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Distance-Based Representative Skyline
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
Randomized multi-pass streaming skyline algorithms
Proceedings of the VLDB Endowment
Structured search result differentiation
Proceedings of the VLDB Endowment
Efficient skyline evaluation over partially ordered domains
Proceedings of the VLDB Endowment
On finding skylines in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient diversity-aware search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Representative skylines using threshold-based preference distributions
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Mining of Massive Datasets
Finding the most desirable skyline objects
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Dynamic diversification of continuous data
Proceedings of the 15th International Conference on Extending Database Technology
Computational aspects of the maximum diversity problem
Operations Research Letters
Efficient and domain-invariant competitor mining
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
Skyline queries have attracted considerable attention by the database community during the last decade, due to their applicability in a series of domains. However, most existing works tackle the problem from an efficiency standpoint, i.e., returning the skyline as quickly as possible. The user is then presented with the entire skyline set, which may be in several cases overwhelming, therefore requiring manual inspection to come up with the most informative data points. To overcome this shortcoming, we propose a novel approach in selecting the k most diverse skyline points, i.e., the ones that best capture the different aspects of both the skyline and the dataset they belong to. We present a novel formulation of diversification which, in contrast to previous proposals, is intuitive, because it is based solely on the domination relationships among points. Consequently, additional artificial distance measures (e.g., Lp norms) among skyline points are not required. We present efficient approaches in solving this problem and demonstrate the efficiency and effectiveness of our approach through an extensive experimental evaluation with both real-life and synthetic data sets.