(Enter summary)
Abstract: We propose efficient algorithms for learning ranking functions from order
constraints between sets---i.e. classes---of training samples. Our algorithms
may be used for maximizing the generalized Wilcoxon Mann
Whitney statistic that accounts for the partial ordering of the classes: special
cases include maximizing the area under the ROC curve for binary
classification and its generalization for ordinal regression. Experiments
on public benchmarks indicate that: (a) the proposed algorithm... (Update)
Cited by: More
Efficient Learning of Label Ranking by Soft Projections.. - Shalev-Shwartz, Singer (2006)
(Correct)
Active bibliography (related documents): More All
0.6: Log-Linear Models for Label Ranking - Dekel, Manning, Singer (2003)
(Correct)
0.4: On Maximum Margin Hierarchical Multilabel Classification - Rousu, Saunders, al. (2004)
(Correct)
0.3: Clustering with Propagation for Hierarchical Document.. - Sona, al.
(Correct)
Similar documents based on text:
6.0: Unknown -
(Correct)
BibTeX entry: (Update)
G. Fung, R. Rosales, and B. Krishnapuram. Learning rankings via convex hull separation. In Advances in Neural Information Processing Systems 18, 2006. http://citeseer.ist.psu.edu/fung06learning.html More
@misc{ fung06learning,
author = "G. Fung and R. Rosales and B. Krishnapuram",
title = "Learning rankings via convex hull separation",
text = "G. Fung, R. Rosales, and B. Krishnapuram. Learning rankings via convex
hull separation. In Advances in Neural Information Processing Systems 18,
2006.",
year = "2006",
url = "citeseer.ist.psu.edu/fung06learning.html" }
Citations (may not include all citations):
1291
The nature of statistical learning theory (context) - Vapnik - 2000 ACM
640
Princeton University Press (context) - Rockafellar, analysis - 1970
520
Generalized linear models (context) - McCullagh, Nelder - 1983
119
Nonlinear programming (context) - Mangasarian - 1969
57
Optimizing search engines using clickthrough data
- Joachims - 2002 ACM DBLP
41
An efficient boosting algorithm for combining preferences
- Freund, Iyer et al. - 2003 ACM DBLP
17
Large margin rank boundaries for ordinal regression (context) - Herbrich, Graepel et al. - 2000
11
Pranking with ranking
- Crammer, Singer - 2002 DBLP
9
Fast sparse gaussian process methods: The informative vector..
- Lawrence, Seeger et al. - 2002
8
Support vector machine learning for interdependent and struc..
- Tsochantaridis, Hofmann et al. - 2004 ACM
3
Learning with taxonomies: Classifying documents and words
- Hofmann, Cai et al. - 2003
2
Conditional models on the ranking poset
- Lebanon, Lafferty - 2002
1
Gaussian processes for ordinal regression
- Chu, Ghahramani - 2004
1
Advances in Large Margin Classifiers (context) - vector - 2000 ACM
Documents on the same site (http://books.nips.cc/nips18.html): More
Q-Clustering - Narasimhan, Jojic, Bilmes (2005)
(Correct)
Learning from Data of Variable Quality - Koby Crammer Michael
(Correct)
Statistical Convergence of Kernel CCA - Kenji Fukumizu Institute
(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