Sciweavers

82 search results - page 10 / 17
» Learning a ranking from pairwise preferences
Sort
View
ICML
2010
IEEE
13 years 8 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
WWW
2010
ACM
14 years 2 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
13 years 9 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
NIPS
2003
13 years 9 months ago
Log-Linear Models for Label Ranking
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
Ofer Dekel, Christopher D. Manning, Yoram Singer
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 8 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...