Randomized algorithms
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
An optimal algorithm for Monte Carlo estimation
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Model-driven data acquisition in sensor networks
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
SoftRank: optimizing non-smooth rank metrics
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Ranking queries on uncertain data: a probabilistic threshold approach
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Learning to rank with SoftRank and Gaussian processes
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Efficient search for the top-k probable nearest neighbors in uncertain databases
Proceedings of the VLDB Endowment
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Processing of Top-k Queries in Uncertain Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Consensus answers for queries over probabilistic databases
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Top-k queries on uncertain data: on score distribution and typical answers
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
A unified approach to ranking in probabilistic databases
Proceedings of the VLDB Endowment
Probabilistic nearest-neighbor query on uncertain objects
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
PODS: a new model and processing algorithms for uncertain data streams
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Building ranked mashups of unstructured sources with uncertain information
Proceedings of the VLDB Endowment
A unified approach to ranking in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Search computing
Ranking with uncertain scoring functions: semantics and sensitivity measures
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient probabilistic reverse nearest neighbor query processing on uncertain data
Proceedings of the VLDB Endowment
On the semantics of top-k ranking for objects with uncertain data
Computers & Mathematics with Applications
Probabilistic filters: A stream protocol for continuous probabilistic queries
Information Systems
Probabilistic ranking in fuzzy object databases
Proceedings of the 21st ACM international conference on Information and knowledge management
Computing immutable regions for subspace top-k queries
Proceedings of the VLDB Endowment
Top-K aggregate queries on continuous probabilistic datasets
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Mining order-preserving submatrices from probabilistic matrices
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to much work in understanding how to rank uncertain datasets in recent years. In this paper, we address the problem of ranking when the tuple scores are uncertain, and the uncertainty is captured using continuous probability distributions (e.g. Gaussian distributions). We present a comprehensive solution to compute the values of a parameterized ranking function (PRF) [18] for arbitrary continuous probability distributions (and thus rank the uncertain dataset); PRF can be used to simulate or approximate many other ranking functions proposed in prior work. We develop exact polynomial time algorithms for some continuous probability distribution classes, and efficient approximation schemes with provable guarantees for arbitrary probability distributions. Our algorithms can also be used for exact or approximate evaluation of k-nearest neighbor queries over uncertain objects, whose positions are modeled using continuous probability distributions. Our experimental evaluation over several datasets illustrates the effectiveness of our approach at efficiently ranking uncertain datasets with continuous attribute uncertainty.