1088 search results - page 120 / 218 » Probabilistic query expansion using query logs |
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
PODS
2000
ACM
14 years 1 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
BIBM
2010
IEEE
13 years 6 months ago
2010
IEEE
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
ICDE
2012
IEEE
12 years 8 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...