(Enter summary)
Abstract: We discuss the problem of ranking k instances with the use of a "large
margin" principle. We introduce two main approaches: the first is the
"fixed margin" policy in which the margin of the closest neighboring
classes is being maximized --- which turns out to be a direct generalization
of SVM to ranking learning. The second approach allows for k \Gamma 1
different margins where the sum of margins is maximized. This approach
is shown to reduce to -SVM when the number of classes k = 2.
... (Update)
Cited by: More
Direct Maximization of Rank-based Metrics - Metzler (2005)
(Correct)
Gaussian Processes for Ordinal Regression - Chu, Ghahramani (2005)
(Correct)
Maximum-Margin Matrix Factorization - Srebro, Rennie, Jaakola (2005)
(Correct)
Similar documents (at the sentence level):
52.5%: Taxonomy of Large Margin Principle Algorithms for Ordinal.. - Shashua, Levin (2002)
(Correct)
42.5%: Ranking with Large Margin Principle: Two Approaches - Shashua, Levin (2003)
(Correct)
Active bibliography (related documents): More All
0.3: Support Vector Machines for Analog Circuit.. - De Bernardinis.. (2003)
(Correct)
0.1: Optimal Properties and Adaptive Tuning of Standard and.. - Wahba, Lin, Lee, Zhang (2002)
(Correct)
0.1: Evaluating the Robustness of Learing from Implicit Feedback - Radlinski, Joachims
(Correct)
Similar documents based on text: More All
0.5: On Representation Theory in Computer Vision Problems - Shashua, Meshulam, Wolf (2002)
(Correct)
0.3: Manifold Pursuit: A New Approach to Appearance Based.. - Amnon Shashua Stanford (2002)
(Correct)
0.3: Novel View Synthesis in Tensor Space - Avidan, Shashua (1997)
(Correct)
Related documents from co-citation: More All
3: Learning the kernel matrix with semidefinite programming
- Lanckriet, Bartlett et al. - 2002
3: Weighted low rank approximation
- Srebro, Jaakkola - 2003
2: Latent semantic models for collaborative filtering (context) - Hofmann - 2004
BibTeX entry: (Update)
Amnon Shashua and Anat Levin. Ranking with large margin principle: Two approaches. In NIPS*14, 2003. http://citeseer.ist.psu.edu/article/shashua03ranking.html More
@misc{ shashua03ranking,
author = "A. Shashua and A. Levin",
title = "Ranking with large margin principle: Two approaches",
text = "Amnon Shashua and Anat Levin. Ranking with large margin principle: Two
approaches. In NIPS*14, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/shashua03ranking.html" }
Citations (may not include all citations):
520
Generalized Linear Models (context) - McCullagh, Nelder - 1989
61
Learning to order things
- Cohen, Schapire et al. - 1999
49
New support vector algorithms
- Scholkopf, Smola et al. - 2000
40
The nature of statistical learning (context) - Vapnik - 1998
28
the algorithmic implementation of multiclass kernel-based ve..
- Crammer, Singer - 2001
17
Large margin rank boundaries for ordinal regression (context) - Herbrich, Graepel et al. - 2000
16
Support vector machines for multi-class pattern recognition
- Weston, Watkins - 1999
11
Multicategory support vector machines
- Lee, Lin et al. - 2001
11
Pranking with ranking
- Crammer, Singer - 2001
4
A training algorithm for optimal margin classifers (context) - Boser, Guyon et al. - 1992
3
Training --Support Vector classifiers: Theory and Algorithms (context) - Chang, Lin - 2002
3
Taxonomy of Large Margin Principle Algorithms for Ordinal Re..
- Shashua, Levin
http://www.research.compaq.com/SRC/eachmovie/
Documents on the same site (http://books.nips.cc/nips15.html): More
Learning Attractor Landscapes for Learning Motor Primitives - Ijspeert, Nakanishi, Schaal (2003)
(Correct)
A Statistical Mechanics Approach to Approximate Analytical.. - Malzahn, Opper (2003)
(Correct)
Going Metric: Denoising Pairwise Data - Roth, Laub, Buhmann, Müller (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC