Sciweavers

91 search results - page 3 / 19
» Conditional Models for Non-smooth Ranking Loss Functions
Sort
View
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
NIPS
2003
13 years 9 months ago
Margin Maximizing Loss Functions
Margin maximizing properties play an important role in the analysis of classi£cation models, such as boosting and support vector machines. Margin maximization is theoretically in...
Saharon Rosset, Ji Zhu, Trevor Hastie
JMLR
2012
11 years 10 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
ICML
2008
IEEE
14 years 8 months ago
Listwise approach to learning to rank: theory and algorithm
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimi...
Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, Ha...
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