On equivalence relationships between classification and ranking algorithms

Journal of Machine Learning Research

Volumn 12, Issue , 2011, Pages 2905-2929

  Ertekin, Şeyda ^a   Rudin, Cynthia ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Area under the curve; Bipartite ranking; Boosting; Logistic regression; Rank statistics; Supervised classification

Indexed keywords

AREA UNDER THE CURVES; BIPARTITE RANKING; BOOSTING; LOGISTIC REGRESSION; RANK STATISTICS; SUPERVISED CLASSIFICATION;

ADAPTIVE BOOSTING; REGRESSION ANALYSIS;

ALGORITHMS;

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

References (22)

1. Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, and Gregory B. Sorkin. Robust reductions from ranking to classification. Machine Learning, 72:139-153, 2008.
2. Leo Breiman. Arcing the edge. Technical Report 486, Statistics Department, University of California at Berkeley, 1997.
3. Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender. Learning to rank using gradient descent. In Proceedings of the 22nd International Conference on Machine Learning (ICML), pages 89-96, 2005. (Pubitemid 43183320)
4. Rich Caruana and Alexandru Niculescu-Mizil. An empirical comparison of supervised learning algorithms. In Proceedings of the 23rd International Conference on Machine Learning (ICML), pages 161-168, 2006.
5. Michael Collins, Robert E. Schapire, and Yoram Singer. Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48:253-285, 2002. (Pubitemid 34247580)
6. Nigel Duffy and David P. Helmbold. A geometric approach to leveraging weak learners. In European Conference on Computational Learning Theory (EuroCOLT). Springer-Verlag, 1999.
7. Wei Fan, Salvatore J. Stolfo, Junxin Zhang, and Philip K. Chan. Adacost: Misclassification costsensitive boosting. In Proceedings of the 16th International Conference on Machine Learning (ICML), pages 97-105, 1999.
8. Andrew Frank and Arthur Asuncion. UCI machine learning repository, 2010. URL http://archive.ics.uci.edu/ml.
9. Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55:119-139, 1997. (Pubitemid 127433398)
10. Yoav Freund, Raj Iyer, Robert E. Schapire, and Yoram Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research (JMLR), 4:933-969, 2003.
11. Jerome Friedman, Trevor Hastie, and Robert Tibshirani. Additive logistic regression: A statistical view of boosting. Annals of Statistics, 28(2):337-374, 2000.
12. Wojciech Kotlowski, Krzysztof Dembczynski, and Eyke Huellermeier. Bipartite ranking through minimization of univariate loss. In Proceedings of the 28th International Conference on Machine Learning (ICML), pages 1113-1120, 2011.
13. Aurélie C. Lozano and Naoki Abe. Multi-class cost-sensitive boosting with p-norm loss functions. In Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 506-514, 2008.
14. Llew Mason, Jonathan Baxter, Peter Bartlett, and Marcus Frean. Boosting algorithms as gradient descent. In Proceedings of Neural Information Processing Systems (NIPS), 2000.
15. David Mease, Abraham J. Wyner, and Andreas Buja. Boosted classification trees and class probability/quantile estimation. Journal of Machine Learning Research (JMLR), 8:409-439, 2007. (Pubitemid 46434120)
16. Indraneel Mukherjee, Cynthia Rudin, and Robert Schapire. The rate of convergence of AdaBoost. In Proceedings of the 24th Annual Conference on Learning Theory (COLT), 2011.
17. Gunnar Rätsch, Takashi Onoda, and Klaus-Robert Müller. Soft margins for AdaBoost. Machine Learning, 42(3):287-320, 2001. (Pubitemid 32188795)
18. Cynthia Rudin. The P-Norm Push: A simple convex ranking algorithm that concentrates at the top of the list. Journal of Machine Learning Research (JMLR), 10:2233-2271, 2009.
19. Cynthia Rudin and Robert E. Schapire. Margin-based ranking and an equivalence between Ada-Boost and RankBoost. Journal of Machine Learning Research (JMLR), 10:2193-2232, 2009.
20. Robert E. Schapire and Yoav Freund. Boosting: Foundations and Algorithms. MIT Press, 2011. In Preparation.
21. Yanmin Sun, Mohamed S. Kamel, Andrew K. C. Wong, and Yang Wang. Cost-sensitive boosting for classification of imbalanced data. Pattern Recognition, 40:3358-3378, 2007. (Pubitemid 47223287)
22. David H. Wolpert and William G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, 1997. (Pubitemid 127771019)