nips nips2005 nips2005-114 nips2005-114-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Glenn Fung, Rómer Rosales, Balaji Krishnapuram
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 is at least as accurate as the current state-of-the-art; (b) computationally, it is several orders of magnitude faster and—unlike current methods—it is easily able to handle even large datasets with over 20,000 samples. 1
[1] W. Chu and Z. Ghahramani, Gaussian processes for ordinal regression, Tech. report, University College London, 2004.
[2] K. Crammer and Y. Singer, Pranking with ranking, Neural Info. Proc. Systems, 2002.
[3] Y. Freund, R. Iyer, and R. Schapire, An efficient boosting algorithm for combining preferences, Journal of Machine Learning Research 4 (2003), 933–969.
[4] R. Herbrich, T. Graepel, and K. Obermayer, Large margin rank boundaries for ordinal regression, Advances in Large Margin Classifiers (2000), 115–132.
[5] T. Hofmann, L. Cai, and M. Ciaramita, Learning with taxonomies: Classifying documents and words, (NIPS) Workshop on Syntax, Semantics, and Statistics, 2003.
[6] T. Joachims, Optimizing search engines using clickthrough data, Proc. ACM Conference on Knowledge Discovery and Data Mining (KDD), 2002.
[7] N. Lawrence, M. Seeger, and R. Herbrich, Fast sparse gaussian process methods: The informative vector machine, Neural Info. Proc. Systems, 2002.
[8] G. Lebanon and J. Lafferty, Conditional models on the ranking poset, Neural Info. Proc. Systems, 2002.
[9] O. L. Mangasarian, Nonlinear programming, McGraw–Hill, New York, 1969, Reprint: SIAM Classic in Applied Mathematics 10, 1994, Philadelphia.
[10] , Generalized support vector machines, Advances in Large Margin Classifiers, 2000, pp. 135–146.
[11] P. McCullagh and J. Nelder, Generalized linear models, Chapman & Hall, 1983.
[12] R. T. Rockafellar, Convex analysis, Princeton University Press, Princeton, New Jersey, 1970.
[13] I. Tsochantaridis, T. Hofmann, T. Joachims, and Y. Altun, Support vector machine learning for interdependent and structured output spaces, Int.Conf. on Machine Learning, 2004.
[14] V. N. Vapnik, The nature of statistical learning theory, second ed., Springer, New York, 2000.