Sciweavers

1088 search results - page 24 / 218
» Probabilistic query expansion using query logs
Sort
View
SPAA
2009
ACM
14 years 11 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
ICCV
2007
IEEE
14 years 4 months ago
Total Recall: Automatic Query Expansion with a Generative Feature Model for Object Retrieval
Given a query image of an object, our objective is to retrieve all instances of that object in a large (1M+) image database. We adopt the bag-of-visual-words architecture which ha...
Ondrej Chum, James Philbin, Josef Sivic, Michael I...
EVOW
2008
Springer
14 years 5 days ago
Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach
Nowadays, searching information in the web or in any kind of document collection has become one of the most frequent activities. However, user queries can be formulated in a way th...
Lourdes Araujo, José R. Pérez-Ag&uum...
IPM
2007
123views more  IPM 2007»
13 years 10 months ago
Using query logs to establish vocabularies in distributed information retrieval
Users of search engines express their needs as queries, typically consisting of a small number of terms. The resulting search engine query logs are valuable resources that can be ...
Milad Shokouhi, Justin Zobel, Seyed M. M. Tahaghog...
SIGIR
2009
ACM
14 years 4 months ago
What queries are likely to recur in web search?
We study the recurrence dynamics of queries in Web search by analysing a large real-world query log dataset. We find that query frequency is more useful in predicting collective ...
Dell Zhang, Jinsong Lu