Skyline probability over uncertain preferences

Publication Type:
Conference Proceeding
ACM International Conference Proceeding Series, 2013, pp. 395 - 405
Issue Date:
Filename Description Size
Thumbnail2013005454OK.pdf664.07 kB
Adobe PDF
Full metadata record
Skyline analysis is a key in a wide spectrum of real applications involving multi-criteria optimal decision making. In recent years, a considerable amount of research has been contributed on efficient computation of skyline probabilities over uncertain environment. Most studies if not all, assume uncertainty lies only in attribute values. To the extent of our knowledge, only one study addresses the skyline probability computation problem in scenarios where uncertainty resides in attribute preferences, instead of values. However this study takes a problematic approach by assuming independent object dominance, which we find is not always true in uncertain preference scenarios. In fact this assumption has already been shown to be not necessarily true in uncertain value scenarios. Motivated by this, we revisit the skyline probability computation over uncertain preferences in this paper. We first show that the problem of skyline probability computation over uncertain preferences is #P-complete. Then we propose efficient exact and approximate algorithms to tackle this problem. While the exact algorithm remains exponential in the worst case, our experiments demonstrate its efficiency in practice. The approximate algorithm achieves ε-approximation by the confidence (1 - Δ) with time complexity O(dn 1/ε2 ln 1/Δ), where n is the number of objects and d is the dimensionality. The efficiency and effectiveness of our methods are verified by extensive experimental results on real and synthetic data sets. © 2013 ACM.
Please use this identifier to cite or link to this item: