Cranking: Combining Rankings Using Conditional Probability Models on Permutations
暂无分享,去创建一个
[1] P. Diaconis,et al. Eigen Analysis for Some Examples of the Metropolis Algorithm , 1992 .
[2] Yoram Singer,et al. Logistic Regression, AdaBoost and Bregman Distances , 2000, Machine Learning.
[3] D. Critchlow. Metric Methods for Analyzing Partially Ranked Data , 1986 .
[4] M. Fligner,et al. Posterior probabilities for a consensus ordering , 1990 .
[5] John D. Lafferty,et al. Boosting and Maximum Likelihood for Exponential Models , 2001, NIPS.
[6] P. Diaconis. Group representations in probability and statistics , 1988 .
[7] Joseph S. Verducci,et al. Probability Models and Statistical Analyses for Ranking Data , 1992 .
[8] L. Thurstone,et al. A low of comparative judgement , 1927 .
[9] M. Fligner,et al. Distance Based Ranking Models , 1986 .
[10] Yoram Singer,et al. An Efficient Boosting Algorithm for Combining Preferences by , 2013 .
[11] Javed A. Aslam,et al. Models for metasearch , 2001, SIGIR '01.
[12] C. L. Mallows. NON-NULL RANKING MODELS. I , 1957 .
[13] Yoav Freund,et al. Experiments with a New Boosting Algorithm , 1996, ICML.
[14] R. Manmatha,et al. Modeling score distributions for combining the outputs of search engines , 2001, SIGIR '01.
[15] P. Diaconis. A Generalization of Spectral Analysis with Application to Ranked Data , 1989 .
[16] M. Fligner,et al. Multistage Ranking Models , 1988 .
[17] J. Friedman. Special Invited Paper-Additive logistic regression: A statistical view of boosting , 2000 .
[18] L. Thurstone. A law of comparative judgment. , 1994 .
[19] A. Cayley,et al. LXXVII. Note on the theory of permutations , 1849 .
[20] Yoram Singer,et al. Learning to Order Things , 1997, NIPS.
[21] Garrison W. Cottrell,et al. Fusion Via a Linear Combination of Scores , 1999, Information Retrieval.