Sciweavers

115 search results - page 6 / 23
» The Quantum Probability Ranking Principle for Information Re...
Sort
View
NIPS
2008
15 years 1 months ago
Global Ranking Using Continuous Conditional Random Fields
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...
ECIR
2003
Springer
15 years 1 months ago
From Uncertain Inference to Probability of Relevance for Advanced IR Applications
Uncertain inference is a probabilistic generalisation of the logical view on databases, ranking documents according to their probabilities that they logically imply the query. For ...
Henrik Nottelmann, Norbert Fuhr
ICML
2009
IEEE
16 years 16 days ago
BoltzRank: learning to maximize expected ranking gain
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
Maksims Volkovs, Richard S. Zemel
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
16 years 4 days ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
ECIR
2006
Springer
15 years 1 months ago
A User-Item Relevance Model for Log-Based Collaborative Filtering
Abstract. Implicit acquisition of user preferences makes log-based collaborative filtering favorable in practice to accomplish recommendations. In this paper, we follow a formal ap...
Jun Wang, Arjen P. de Vries, Marcel J. T. Reinders