Sciweavers

3395 search results - page 77 / 679
» Learning to efficiently rank
Sort
View
CIKM
2008
Springer
13 years 11 months ago
Ranking information resources in peer-to-peer text retrieval: an experimental study
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...
Hans F. Witschel
ICML
2003
IEEE
14 years 9 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
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...
Edward F. Harrington
SIGIR
2009
ACM
14 years 3 months ago
Global ranking by exploiting user clicks
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...
Shihao Ji, Ke Zhou, Ciya Liao, Zhaohui Zheng, Gui-...
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 9 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
IPM
2008
100views more  IPM 2008»
13 years 9 months ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...