Sciweavers

829 search results - page 118 / 166
» Minimal document set retrieval
Sort
View
CIKM
2004
Springer
14 years 1 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
SIGIR
2009
ACM
14 years 2 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero
SIGIR
2008
ACM
13 years 7 months ago
A few examples go a long way: constructing query models from elaborate query formulations
We address a specific enterprise document search scenario, where the information need is expressed in an elaborate manner. In our scenario, information needs are expressed using a...
Krisztian Balog, Wouter Weerkamp, Maarten de Rijke
SIGMOD
2009
ACM
144views Database» more  SIGMOD 2009»
14 years 7 months ago
Do we mean the same?: disambiguation of extracted keyword queries for database search
Users often try to accumulate information on a topic of interest from multiple information sources. In this case a user's informational need might be expressed in terms of an...
Elena Demidova, Irina Oelze, Peter Fankhauser
ECIR
2010
Springer
13 years 9 months ago
Learning to Select a Ranking Function
Abstract. Learning To Rank (LTR) techniques aim to learn an effective document ranking function by combining several document features. While the function learned may be uniformly ...
Jie Peng, Craig Macdonald, Iadh Ounis