1940 search results - page 110 / 388 » Optimizing search engines using clickthrough data |
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these...
WWW
2006
ACM
14 years 10 months ago
2006
ACM
One hundred users, one hundred needs. As more and more topics are being discussed on the web and our vocabulary remains relatively stable, it is increasingly difficult to let the ...
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
Scientists often search for document-elements like tables, figures, or algorithm pseudo-codes. Domain scientists and researchers report important data, results and algorithms usi...
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
PREMI
2011
Springer
13 years 29 days ago
2011
Springer
This paper presents a potential seed selection algorithm for web crawlers using a gain - share scoring approach. Initially we consider a set of arbitrarily chosen tourism queries. ...