Sciweavers

1088 search results - page 49 / 218
» Probabilistic query expansion using query logs
Sort
View
EMNLP
2009
13 years 8 months ago
Mining Search Engine Clickthrough Log for Matching N-gram Features
User clicks on a URL in response to a query are extremely useful predictors of the URL's relevance to that query. Exact match click features tend to suffer from severe data s...
Huihsin Tseng, Longbin Chen, Fan Li, Ziming Zhuang...
WWW
2008
ACM
14 years 11 months ago
Asymmetrical query recommendation method based on bipartite network resource allocation
This paper presents a new query recommendation method that generates recommended query list by mining large-scale user logs. Starting from the user logs of click-through data, we ...
Zhiyuan Liu, Maosong Sun
WSDM
2009
ACM
114views Data Mining» more  WSDM 2009»
14 years 5 months ago
Wikipedia pages as entry points for book search
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
Marijn Koolen, Gabriella Kazai, Nick Craswell
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 10 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
ICLP
2009
Springer
14 years 11 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...