Bounds on skyline probability for databases with uncertain preferences

For determining skyline objects for an uncertain database with uncertain preferences, it is necessary to compute the skyline probability of a given object with respect to other objects. The problem boils down to computing the probability of the union of events from the probabilities of all possible...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of approximate reasoning Ročník 80; s. 199 - 213
Hlavní autoři: Pujari, Arun K., Padmanabhan, Vineet, Kagita, Venkateswara Rao
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.01.2017
Témata:
Algorithms
Bounds
Computation
Computing time
Mathematical models
Maximization
Optimization
Skyline probability
Uncertain preferences
Unions
Skyline probability
Bounds
Uncertain preferences
ISSN:0888-613X, 1873-4731
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:For determining skyline objects for an uncertain database with uncertain preferences, it is necessary to compute the skyline probability of a given object with respect to other objects. The problem boils down to computing the probability of the union of events from the probabilities of all possible joint probabilities. Linear Bonferroni bound is concerned with computing the bounds on the probability of the union of events with partial information. We use this technique to estimate the skyline probability of an object and propose a polynomial-time algorithm for computing sharp upper bound. We show that the use of partial information does not affect the quality of solution but helps in improving the efficiency. We formulate the problem as a Linear Programming Problem (LPP) and characterize a set of feasible points that is believed to contain all extreme points of the LPP. The maximization of the objective function over this set of points is equivalent to a bi-polar quadratic optimization problem. We use a spectral relaxation technique to solve the bi-polar quadratic optimization problem. The proposed algorithm is of O(n3) time complexity and is the first ever polynomial-time algorithm to determine skyline probability. We show that the bounds computed by our proposed algorithm determine almost the same set of skyline objects as that with the deterministic algorithm. Experimental results are presented to corroborate this claim. •In this paper we propose three different bounds on skyline probability.•Computation of skyline points using these bounds is more accurate than the earlier sampling based technique.•Our algorithm determines almost the same set of skyline objects as that with the exact method.•We validate our hypothesis by experiments on real and synthetic datasets.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0888-613X
1873-4731
DOI:10.1016/j.ijar.2016.09.004