Sciweavers

1088 search results - page 68 / 218
» Probabilistic query expansion using query logs
Sort
View
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
14 years 10 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 5 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
EDBT
2009
ACM
173views Database» more  EDBT 2009»
14 years 2 months ago
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
Mi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan C...
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 7 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
BNCOD
2003
138views Database» more  BNCOD 2003»
13 years 11 months ago
Aggregate Table-Driven Querying via Navigation Ontologies in Distributed Statistical Databases
In this paper we describe a query paradigm based on ontologies, aggregate table-driven querying and expansion of QBE. It has two novel features: visually specifying aggregate table...
Yaxin Bi, David A. Bell, Joanne Lamb