736 search results - page 37 / 148 » Ranking Query Results using Context-Aware Preferences |
237
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
141
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
147
click to vote
ECIR
2007
Springer
15 years 5 months ago
2007
Springer
We consider the issue of query performance, and we propose a novel method for automatically predicting the difficulty of a query. Unlike a number of existing techniques which are b...
132
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
In order to deal with the diversified nature of XML documents as well as individual user preferences, we propose a novel Multiodel (MRM), which is able to abstract a spectrum of i...
136
Voted
WAW
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...