Sciweavers

2164 search results - page 87 / 433
» Learning to rank for information retrieval
Sort
View
WWW
2008
ACM
16 years 7 months ago
Online learning from click data for sponsored search
Sponsored search is one of the enabling technologies for today's Web search engines. It corresponds to matching and showing ads related to the user query on the search engine...
Massimiliano Ciaramita, Vanessa Murdock, Vassilis ...
WWW
2004
ACM
16 years 7 months ago
Distributed ranking over peer-to-peer networks
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...
Dexter Chi Wai Siu, Tak Pang Lau
DA
2010
123views more  DA 2010»
15 years 3 months ago
Paradoxes in Learning and the Marginal Value of Information
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
Peter Frazier, Warren B. Powell
CIKM
2011
Springer
14 years 6 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
IOR
2011
107views more  IOR 2011»
15 years 1 months ago
Information Collection on a Graph
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
Ilya O. Ryzhov, Warren B. Powell