Sciweavers

1088 search results - page 48 / 218
» Probabilistic query expansion using query logs
Sort
View
COLT
2001
Springer
14 years 2 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
WWW
2007
ACM
14 years 11 months ago
Identifying ambiguous queries in web search
It is widely believed that some queries submitted to search engines are by nature ambiguous (e.g., java, apple). However, few studies have investigated the questions of "how ...
Ruihua Song, Zhenxiao Luo, Ji-Rong Wen, Yong Yu, H...
WWW
2009
ACM
14 years 5 months ago
A probabilistic model based approach for blended search
In this paper, we propose to model the blended search problem by assuming conditional dependencies among queries, VSEs and search results. The probability distributions of this mo...
Ning Liu, Jun Yan, Zheng Chen
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 10 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 10 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin