不确定数据集上所有受限天际线概率的计算
Computing All Restricted Skyline Probabilities on Uncertain Datasets
AI总结:
本文研究不确定数据集上的受限天际线概率计算问题,证明其难以在真正次二次时间内求解,并针对线性评分函数提出多种高效算法,兼顾近最优与期望时间复杂度,实验验证了算法的有效性和可扩展性。
摘要:
受限天际线(rskyline)查询在多准则决策中被广泛使用。它通过额外考虑一组个性化评分函数 F 对天际线查询进行了推广。由于多准则决策的数据集中固有地存在不确定性,我们从复杂性和算法两个角度研究不确定数据集上的 rskyline 查询。我们将计算所有数据项的 rskyline 概率这一问题形式化,并证明除非正交向量猜想不成立,否则没有任何算法能在真正的次二次时间内解决该问题。考虑到线性评分函数在实际应用中被广泛使用,我们针对 F 是一组其权重由线性约束描述的线性评分函数的情形提出了两种高效算法,一种具有近最优时间复杂度,另一种具有更好的期望时间复杂度。对于涉及一系列权重比率的特殊线性约束,我们进一步设计了一种具有亚线性查询时间和多项式预处理时间的算法。大量实验证明了我们所提算法的有效性、效率、可扩展性和实用性。
英文摘要:
Restricted skyline (rskyline) query is widely used in multi-criteria decision making. It generalizes the skyline query by additionally considering a set of personalized scoring functions F. Since uncertainty is inherent in datasets for multi-criteria decision making, we study rskyline queries on uncertain datasets from both complexity and algorithm perspective. We formalize the problem of computing rskyline probabilities of all data items and show that no algorithm can solve this problem in truly subquadratic-time, unless the orthogonal vectors conjecture fails. Considering that linear scoring functions are widely used in practical applications, we propose two efficient algorithms for the case where $\calF$ is a set of linear scoring functions whose weights are described by linear constraints, one with near-optimal time complexity and the other with better expected time complexity. For special linear constraints involving a series of weight ratios, we further devise an algorithm with sublinear query time and polynomial preprocessing time. Extensive experiments demonstrate the effectiveness, efficiency, scalability, and usefulness of our proposed algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。