Sciweavers

469 search results - page 4 / 94
» Cluster-based query expansion
Sort
View
SIGIR
2010
ACM
15 years 1 months ago
Query recovery of short user queries: on query expansion with stopwords
User queries to search engines are observed to predominantly contain inflected content words but lack stopwords and capitalization. Thus, they often resemble natural language que...
Johannes Leveling, Gareth J. F. Jones
78
Voted
ICRA
2007
IEEE
125views Robotics» more  ICRA 2007»
15 years 4 months ago
Single-Query Motion Planning with Utility-Guided Random Trees
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
Brendan Burns, Oliver Brock
JIS
2006
96views more  JIS 2006»
14 years 10 months ago
A study of the effect of term proximity on query expansion
Query expansion terms are often used to enhance original query formulations in document retrieval. Such terms are usually selected from the entire documents or from windows or pas...
Olga Vechtomova, Ying Wang
CIKM
2001
Springer
15 years 2 months ago
The Effectiveness of Query Expansion for Distributed Information Retrieval
Query expansion has been shown effective for both single database retrieval and for distributed information retrieval where complete collection information is available. One might...
Paul Ogilvie, James P. Callan
TREC
2004
14 years 11 months ago
Fondazione Ugo Bordoni at TREC 2004
Our participation in TREC 2004 aims to extend and improve the use of the DFR (Divergence From Randomness) models with Query Expansion (QE) for the robust track. We experiment with...
Gianni Amati, Claudio Carpineto, Giovanni Romano