An efficient reduction of ranking to classification

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 87-97

  Ailon, Nir ^a   Mohri, Mehryar ^a  

^a GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CLASSIFICATION; BINARY CLASSIFIERS; EXPECTED TIME; LEARNING PROBLEM; LOSS FUNCTIONS; PREFERENCE FUNCTIONS; REALISTIC APPLICATIONS; TIME COMPLEXITY;

MACHINE DESIGN; SEARCH ENGINES;

ALGORITHMS;

EID: 84898065480     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Agarwal, S., Graepel, T., Herbrich, R., Har-Peled, S., & Roth, D. (2005). Generalization bounds for the area under the roc curve. Journal of Machine Learning Research, 6, 393-425.
2. Agarwal, S., & Niyogi, P. (2005). Stability and generalization of bipartite ranking algorithms. COLT (pp. 32-47).
3. Ailon, N. (2007). Aggregation of partial rankings, p-ratings and top-m lists. SODA.
4. Ailon, N., Charikar, M., & Newman, A. (2005). Aggregating inconsistent information: ranking and clustering. Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 (pp. 684-693). ACM.
5. Alon, N. (2006). Ranking tournaments. SIAM J. Discrete Math., 20, 137-142.
6. Ariely, D., Loewenstein, G., & Prelec, D. (2008). Coherent arbitrariness: Stable demand curves without stable preferences. The Quarterly Journal of Economics, 118, 73-105.
7. Arrow, K. J. (1950). A difficulty in the concept of social welfare. Journal of Political Economy, 58, 328-346.
8. Balcan, M.-F., Bansal, N., Beygelzimer, A., Coppersmith, D., Langford, J., & Sorkin, G. B. (2007). Robust reductions from ranking to classification. COLT (pp. 604-619). Springer.
9. Clémençon, S., & Vayatis, N. (2007). Ranking the best instances. Journal of Machine Learning Research, 8, 2671-2699.
10. Cohen, W. W., Schapire, R. E., & Singer, Y. (1999). Learning to order things. J. Artif. Intell. Res. (JAIR), 10, 243-270.
11. Coppersmith, D., Fleischer, L., & Rudra, A. (2006). Ordering by weighted number of wins gives a good ranking for weighted tournamnets. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
12. Cortes, C., Mohri, M., & Rastogi, A. (2007a). An Alternative Ranking Problem for Search Engines. Proceedings of the 6th Workshop on Experimental Algorithms (WEA 2007) (pp. 1-21). Rome, Italy: Springer-Verlag, Heidelberg, Germany.
13. Cortes, C., Mohri, M., & Rastogi, A. (2007b). MagnitudePreserving Ranking Algorithms. Proceedings of the Twenty-fourth International Conference on Machine Learning (ICML 2007). Oregon State University, Corvallis, OR.
14. Cossock, D., & Zhang, T. (2006). Subset ranking using regression. COLT (pp. 605-619).
15. Crammer, K., & Singer, Y. (2001). Pranking with ranking. Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, NIPS 2001, December 3-8, 2001, Vancouver, British Columbia, Canada] (pp. 641-647). MIT Press.
16. Freund, Y., Iyer, R. D., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933-969.
17. Hanley, J. A., & McNeil, B. J. (1982). The meaning and use of the area under a receiver operating characteristic (roc) curve. Radiology.
18. Hedge, R., Jain, K., Williamson, D. P., & van Zuylen, A. (2007). "deterministic pivoting algorithms for constrained ranking and clustering problems". Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA).
19. Hoare, C. (1961). Quicksort: Algorithm 64. Comm. ACM, 4, 321-322.
20. Joachims, T. (2002). Optimizing search engines using click-through data. KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 133-142). New York, NY, USA: ACM Press.
21. Kenyon-Mathieu, C., & Schudy, W. (2007). How to rank with few errors. STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (pp. 95-103). New York, NY, USA: ACM Press.
22. Lehmann, E. L. (1975). Nonparametrics: Statistical methods based on ranks. San Francisco, California: Holden-Day.
23. Montague, M. H., & Aslam, J. A. (2002). Condorcet fusion for improved retrieval. Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, McLean, VA, USA, November 4-9, 2002 (pp. 538-548). ACM.
24. Rudin, C., Cortes, C., Mohri, M., & Schapire, R. E. (2005). Margin-based ranking meets boosting in the middle. Learning Theory, 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings (pp. 63-78). Springer.
25. Williamson, D. P., & van Zuylen, A. (2007). "deterministic algorithms for rank aggregation and other ranking and clustering problems". Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA) (to appear).