Sciweavers

342 search results - page 20 / 69
» Branch-and-bound processing of ranked queries
Sort
View
ECIR
2008
Springer
13 years 9 months ago
Robust Query-Specific Pseudo Feedback Document Selection for Query Expansion
In document retrieval using pseudo relevance feedback, after initial ranking, a fixed number of top-ranked documents are selected as feedback to build a new expansion query model. ...
Qiang Huang, Dawei Song, Stefan M. Rüger
SIGIR
2008
ACM
13 years 7 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
SEMWEB
2009
Springer
14 years 2 months ago
Using Naming Authority to Rank Data and Ontologies for Web Search
Abstract. The focus of web search is moving away from returning relevant documents towards returning structured data as results to user queries. A vital part in the architecture of...
Andreas Harth, Sheila Kinsella, Stefan Decker
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 7 months ago
Use of Wikipedia Categories in Entity Ranking
Wikipedia is a useful source of knowledge that has many applications in language processing and knowledge representation. The Wikipedia category graph can be compared with the clas...
James A. Thom, Jovan Pehcevski, Anne-Marie Vercous...
SIGIR
2012
ACM
11 years 10 months ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...