nips nips2002 nips2002-58 nips2002-58-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Guy Lebanon, John D. Lafferty
Abstract: A distance-based conditional model on the ranking poset is presented for use in classification and ranking. The model is an extension of the Mallows model, and generalizes the classifier combination methods used by several ensemble learning algorithms, including error correcting output codes, discrete AdaBoost, logistic regression and cranking. The algebraic structure of the ranking poset leads to a simple Bayesian interpretation of the conditional model and its special cases. In addition to a unifying view, the framework suggests a probabilistic interpretation for error correcting output codes and an extension beyond the binary coding scheme.
[1] M. Collins, R. E. Schapire, and Y. Singer. Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48, 2002.
[2] D. E. Critchlow. Metric Methods for Analyzing Partially Ranked Data. Lecture Notes in Statistics, volume 34, Springer, 1985.
[3] D. E. Critchlow and J. S. Verducci. Detecting a trend in paired rankings. Journal of the Royal Statistical Society C, 41(1):17–29, 1992.
[4] T. G. Dietterich and G. Bakiri. Solving multiclass learning problems via errorcorrecting codes. Journal of Artificial Intelligence Research, 2:263–286, 1995.
[5] P. D. Feigin. Modeling and analyzing paired ranking data. In M. A. Fligner and J. S. Verducci, editors, Probability Models and Statistical Analyses for Ranking Data. Springer, 1992.
[6] M. A. Fligner and J. S. Verducci. Posterior probabilities for a concensus ordering. Psychometrika, 55:53–63, 1990.
[7] Y. Freund and R. E. Schapire. Experiments with a new boosting algorithm. In International Conference on Machine Learning, 1996.
[8] M. G. Kendall. A new measure of rank correlation. Biometrika, 30, 1938.
[9] G. Lebanon and J. Lafferty. Boosting and maximum likelihood for exponential models. In Advances in Neural Information Processing Systems, 15, 2001.
[10] G. Lebanon and J. Lafferty. Cranking: Combining rankings using conditional probability models on permutations. In International Conference on Machine Learning, 2002.
[11] C. L. Mallows. Non-null ranking models. Biometrika, 44:114–130, 1957.
[12] R. P. Stanley. Enumerative Combinatorics, volume 1. Wadsworth & Brooks/Cole Mathematics Series, 1986.