Sciweavers

385 search results - page 1 / 77
» Probabilistic ranking over relations
Sort
View
EDBT
2010
ACM
135views Database» more  EDBT 2010»
13 years 11 months ago
Probabilistic ranking over relations
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin
VLDB
2008
ACM
196views Database» more  VLDB 2008»
14 years 7 months ago
Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes
This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports ...
Thomas Rölleke, Hengzhi Wu, Jun Wang, Hany Azzam
CIKM
2010
Springer
13 years 5 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 9 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
SIGIR
2009
ACM
14 years 2 months ago
On rank correlation and the distance between rankings
Rank correlation statistics are useful for determining whether a there is a correspondence between two measurements, particularly when the measures themselves are of less interest...
Ben Carterette