Sciweavers

1088 search results - page 44 / 218
» Probabilistic query expansion using query logs
Sort
View
ECIR
2010
Springer
13 years 11 months ago
Improving Retrievability of Patents in Prior-Art Search
Prior-art search is an important task in patent retrieval. The success of this task relies upon the selection of relevant search queries. Typically terms for prior-art queries are ...
Shariq Bashir, Andreas Rauber
SIGIR
2012
ACM
12 years 23 days ago
Learning to suggest: a machine learning framework for ranking query suggestions
We consider the task of suggesting related queries to users after they issue their initial query to a web search engine. We propose a machine learning approach to learn the probab...
Umut Ozertem, Olivier Chapelle, Pinar Donmez, Emre...
CC
2008
Springer
131views System Software» more  CC 2008»
13 years 10 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
WWW
2010
ACM
14 years 5 months ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
14 years 4 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz