Ranking forests

Journal of Machine Learning Research

Volumn 14, Issue 1, 2013, Pages 39-73

  Clèmencon, Stèphan ^a   Depecker, Marine ^a   Vayatis, Nicolas ^b  

^a INSTITUT TELECOM   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

AUC criterion; Bagging; Bipartite ranking; Bootstrap; Classification data; Feature randomization; Median ranking; Nonparametric scoring; Rank aggregation; ROC optimization; Tree based ranking rules

Indexed keywords

AUC CRITERION; BAGGING; BIPARTITE RANKING; BOOTSTRAP; FEATURE RANDOMIZATION; MEDIAN RANKING; NON-PARAMETRIC; RANK AGGREGATION; RANKING RULES;

ALGORITHMS; DECISION TREES; FORESTRY; OPTIMIZATION; RANDOM PROCESSES; STATISTICAL METHODS;

CURVE FITTING;

ALGORITHMS; CLASSIFICATION; DATA; DECISION MAKING; FORESTRY; OPTIMIZATION; RANDOM PROCESSES; TREES;

EID: 84873419436     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (54)

1. S. Agarwal, T. Graepel, R. Herbrich, S. Har-Peled, and D. Roth. Generalization bounds for the area under the ROC curve. J. Mach. Learn. Res., 6:393-425, 2005.
2. Y. Amit and D. Geman. Shape quantization and recognition with randomized trees. Neural Computation, 9:1545-1587, 1997.
3. S. Arlot. Model selection by resampling techniques. Electronic Journal of Statistics, 3:557-624, 2009.
4. M.S. Bansal and D. Fernandez-Baca. Computing distances between partial rankings. Information Processing Letters, 109:238-241, 2009.
5. J.P. Barth́elemy and B. Montjardet. The median procedure in cluster analysis and social choice theory. Mathematical Social Sciences, 1:235-267, 1981.
6. N. Baskiotis, S. Cĺemençon, M. Depecker, and N. Vayatis. R-implementation of the TreeRank algorithm. Submitted for publication, 2009.
7. N. Betzler, M.R. Fellows, J. Guo, R. Niedermeier, and F.A. Rosamond. Computing kemeny rankings, parameterized by the average kt-distance. In Proceedings of the 2nd InternationalWorkshop on Computational Social Choice, 2008.
8. G. Biau, L. Devroye, and G. Lugosi. Consistency of Random Forests. J. Mach. Learn. Res., 9: 2039-2057, 2008.
9. L. Breiman. Bagging predictors. Machine Learning, 26:123-140, 1996. (Pubitemid 126724382)
10. L. Breiman. Random forests. Machine Learning, 45(1):5-32, 2001. (Pubitemid 32933532)
11. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth and Brooks, 1984.
12. I. Charon and O. Hudry. Lamarckian genetic algorithms applied to the aggregation of preferences. Annals of Operations Research, 80:281-297, 1998. (Pubitemid 128405234)
13. S. Cĺemençon and N. Vayatis. Ranking the best instances. Journal of Machine Learning Research, 8:2671-2699, 2007.
14. S. Cl'emençon and N. Vayatis. Empirical performance maximization based on linear rank statistics. In NIPS, volume 3559 of Lecture Notes in Computer Science, pages 1-15. Springer, 2009a.
15. S. Cĺemençon and N. Vayatis. Overlaying classifiers: a practical approach to optimal scoring. To appear in Constructive Approximation, 2009b.
16. S. Cĺemençon and N. Vayatis. Tree-based ranking methods. IEEE Transactions on Information Theory, 55(9):4316-4336, 2009c.
17. S. Cl'emençon, G. Lugosi, and N. Vayatis. Ranking and scoring using empirical risk minimization. In Proceedings of COLT, 2005.
18. S. Cĺemençon, G. Lugosi, and N. Vayatis. Ranking and empirical risk minimization of U-statistics. The Annals of Statistics, 36(2):844-874, 2008.
19. S. Cl'emençon, M. Depecker, and N. Vayatis. Bagging ranking trees. Proceedings of ICMLA'09, pages 658-663, 2009.
20. S. Cl'emençon, M. Depecker, and N. Vayatis. AUC-optimization and the two-sample problem. In Proceedings of NIPS'09, 2010.
21. S. Cĺemençon, M. Depecker, and N. Vayatis. Adaptive partitioning schemes for bipartite ranking. Machine Learning, 83(1):31-69, 2011.
22. W.W. Cohen, R.E. Schapire, and Y. Singer. Learning to order things. Journal of Artificial Intelligence Research, 10:243-270, 1999. (Pubitemid 30573909)
23. V. de la Pena and E. Gin'e. Decoupling: from Dependence to Independence. Springer, 1999.
24. M.M. Deza and E. Deza. Encyclopedia of Distances. Springer, 2009.
25. P. Diaconis. A generalization of spectral analysis with application to ranked data. The Annals of Statistics, 17(3):949-979, 1989.
26. R.M. Dudley. Uniform Central Limit Theorems. Cambridge University Press, 1999.
27. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the Web. In Proceedings of the 10th International WWW Conference, pages 613-622, 2001.
28. J.P. Egan. Signal Detection Theory and ROC Analysis. Academic Press, 1975.
29. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing and aggregating rankings with ties. In Proceedings of the 12-th WWW Conference, pages 366-375, 2003.
30. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing partial rankings. SIAM J. Discrete Mathematics, 20(3):628-648, 2006. (Pubitemid 47250574)
31. P. Fishburn. The Theory of Social Choice. University Press, Princeton, 1973.
32. M.A. Fligner and J.S. Verducci . Probability Models and Statistical Analyses for Ranking Data. Springer, 1993.
33. Y. Freund, R. D. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969, 2003.
34. J. Friedman and P. Hall. On bagging and non-linear estimation. Journal of Statistical Planning and Inference, 137(3):669-683, 2007.
35. Y. Grandvalet. Bagging equalizes influence. Machine Learning, 55:251-270, 2004.
36. T. Hastie and R. Tibshirani. Generalized Additive Models. Chapman and Hall/CRC, 1990.
37. J.M. Hilbe. Logistic Regression Models. Chapman and Hall/CRC, 2009.
38. J. Howie. Hyperbolic groups. In Groups and Applications, edited by V. Metaftsis, Ekdoseis Ziti, Thessaloniki, pages 137-160, 2000.
39. O. Hudry. Computation of median orders: complexity results. Annales du LAMSADE: Vol. 3. Proceedings of the Workshop on Computer Science and Decision Theory, DIMACS, 163:179- 214, 2004.
40. O. Hudry. NP-hardness results for the aggregation of linear orders into median orders. Ann. Oper. Res., 163:63-88, 2008.
41. E. Ȟullermeier, J. F̌urnkranz, W. Cheng, and K. Brinker. Label ranking by learning pairwise preferences. Artificial Intelligence, 172:1897-1917, 2008.
42. I. Ilyas, W. Aref, and A. Elmagarmid. Joining ranked inputs in practice. In Proceedings of the 28th International Conference on Very Large Databases, pages 950-961, 2002.
43. J. G. Kemeny. Mathematics without numbers. Daedalus, (88):571-591, 1959.
44. M.G. Kendall. The treatment of ties in ranking problems. Biometrika, (33):239-251, 1945.
45. A. Klementiev, D. Roth, K. Small, and I. Titov. Unsupervised rank aggregation with domain-specific expertise. In IJCAI'09: Proceedings of the 21st International Joint Conference on Artifical Intelligence, pages 1101-1106, San Francisco, CA, USA, 2009. Morgan Kaufmann Publishers Inc.
46. M. Laguna, R. Marti, and V. Campos. Intensification and diversification with elite tabu search solutions for the linear ordering problem. Computers and Operations Research, 26(12):1217- 1230, 1999. (Pubitemid 30024494)
47. G. Lebanon and J. Lafferty. Conditional models on the ranking poset. In Proceedings of NIPS'03, 2003.
48. B. Mandhani and M. Meila. Tractable search for learning exponential models of rankings. In Proceedings of AISTATS, Vol. 5 of JMLR:W&CP 5, 2009.
49. M.Meila, K. Phadnis, A. Patterson, and J. Bilmes. Consensus ranking under the exponential model. In Conference on Artificial Intelligence (UAI), pages 729-734, 2007.
50. P.W. Mielke and K.J. Berry. Permutation Methods. Springer, 2001.
51. A. Nemirovski. Lectures on Probability Theory and Statistics, Ecole d'ete de Probabilities de Saint- Flour XXVIII - 1998, chapter Topics in Non-Parametric Statistics. Number 1738 in Lecture Notes in Mathematics. Springer, 2000.
52. D.M. Pennock, E. Horvitz, and C.L. Giles. Social choice theory and recommender systems: analysis of the foundations of collaborative filtering. In National Conference on Artificial Intelligence, pages 729-734, 2000.
53. J.C. Spall. Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control. John Wiley & Sons, 2003.
54. Y. Wakabayashi. The complexity of computing medians of relations. Resenhas, 3(3):323-349, 1998.