Ranking continuous probabilistic datasets
暂无分享,去创建一个
[1] Ihab F. Ilyas,et al. Ranking with Uncertain Scores , 2009, 2009 IEEE 25th International Conference on Data Engineering.
[2] Wei Hong,et al. Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.
[3] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .
[4] A. Stroud,et al. Gaussian quadrature formulas , 1966 .
[5] Chi-Yin Chow,et al. Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[6] Ke Yi,et al. Dynamic Structures for Top- k Queries on Uncertain Data , 2007, ISAAC.
[7] Anna Liu,et al. PODS: a new model and processing algorithms for uncertain data streams , 2010, SIGMOD Conference.
[8] Ihab F. Ilyas,et al. A survey of top-k query processing techniques in relational database systems , 2008, CSUR.
[9] John Guiver,et al. Learning to rank with SoftRank and Gaussian processes , 2008, SIGIR '08.
[10] Jian Li,et al. Consensus answers for queries over probabilistic databases , 2008, PODS.
[11] Eytan Domany,et al. Ranking Under Uncertainty , 2012, UAI.
[12] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[13] Stephen E. Robertson,et al. SoftRank: optimizing non-smooth rank metrics , 2008, WSDM '08.
[14] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .
[15] Ihab F. Ilyas,et al. Efficient search for the top-k probable nearest neighbors in uncertain databases , 2008, Proc. VLDB Endow..
[16] Jaana Kekäläinen,et al. Cumulated gain-based evaluation of IR techniques , 2002, TOIS.
[17] Richard M. Karp,et al. An Optimal Algorithm for Monte Carlo Estimation , 2000, SIAM J. Comput..
[18] Mohamed A. Soliman,et al. Top-k Query Processing in Uncertain Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[19] Stanley B. Zdonik,et al. Top-k queries on uncertain data: on score distribution and typical answers , 2009, SIGMOD Conference.
[20] Christian Böhm,et al. The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[21] E. Parzen. On Estimation of a Probability Density Function and Mode , 1962 .
[22] Hans-Peter Kriegel,et al. Probabilistic Nearest-Neighbor Query on Uncertain Objects , 2007, DASFAA.
[23] Reynold Cheng,et al. Evaluating probability threshold k-nearest-neighbor queries over uncertain data , 2009, EDBT '09.
[24] Xi Zhang,et al. Semantics and evaluation of top-k queries in probabilistic databases , 2008, 2008 IEEE 24th International Conference on Data Engineering Workshop.
[25] Feifei Li,et al. Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations , 2008, IEEE Trans. Knowl. Data Eng..
[26] Feifei Li,et al. Semantics of Ranking Queries for Probabilistic Data and Expected Ranks , 2009, 2009 IEEE 25th International Conference on Data Engineering.
[27] Jian Li,et al. A unified approach to ranking in probabilistic databases , 2009, The VLDB Journal.
[28] Jian Pei,et al. Ranking queries on uncertain data: a probabilistic threshold approach , 2008, SIGMOD Conference.
[29] M. Kendall. A NEW MEASURE OF RANK CORRELATION , 1938 .