2100 search results - page 99 / 420 » Learning to rank on graphs |
159
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can...
141
click to vote
RECSYS
2009
ACM
16 years 23 days ago
2009
ACM
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ï¬...
165
Voted
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
This paper experimentally studies approaches to the problem of ranking information resources w.r.t. user queries in peer-to-peer information retrieval. In distributed environments...
137
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
187
click to vote
SIGIR
2009
ACM
16 years 23 days ago
2009
ACM
It is now widely recognized that user interactions with search results can provide substantial relevance information on the documents displayed in the search results. In this pape...