Preference-based learning to rank

Machine Learning

Volumn 80, Issue 2-3, 2010, Pages 189-211

  Ailon, Nir ^a   Mohri, Mehryar ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Learning to rank; Machine learning reductions; ROC

Indexed keywords

BINARY CLASSIFICATION; BINARY CLASSIFICATION PROBLEMS; BINARY CLASSIFIERS; DETERMINISTIC ALGORITHMS; INFORMATION EXTRACTION; LEARNING PROBLEM; LEARNING TO RANK; LOWER BOUNDS; MACHINE-LEARNING; PREFERENCE FUNCTIONS; PREFERENCE-BASED; QUICKSORT; RANKING ALGORITHM; REALISTIC APPLICATIONS; ROC; RUNNING TIME; RUNNING-IN; TIME COMPLEXITY; TWO STAGE;

CLASSIFIERS; LEARNING SYSTEMS; MACHINE DESIGN; SEARCH ENGINES;

ALGORITHMS;

EID: 77955661709     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-010-5176-9     Document Type: Article

References (27)

1. S. Agarwal T. Graepel R. Herbrich S. Har-Peled D. Roth 2005 Generalization bounds for the area under the roc curve Journal of Machine Learning Research 6 393 425 1100.34016 2249826
2. Agarwal, S., & Niyogi, P. (2005). Stability and generalization of bipartite ranking algorithms. In COLT (pp. 32-47).
3. Ailon, N. (2007). Aggregation of partial rankings, p-ratings and top-m lists. In SODA.
4. Ailon, N., Charikar, M., & Newman, A. (2005). Aggregating inconsistent information: ranking and clustering. In Proceedings of the 37th annual ACM symposium on theory of computing (pp. 684-693). Baltimore, MD, USA, May 22-24, 2005. New York: ACM.
5. Ailon, N., & Mohri, M. (2008). An efficient reduction of ranking to classification. In Proceedings of the 21st annual conference on learning theory (COLT 2008). Helsinki: Omnipress.
6. N. Alon 2006 Ranking tournaments SIAM Journal Discrete Mathematics 20 137 142 1112.05043 10.1137/050623905 2257251 (Pubitemid 46352091)
7. D. Ariely G. Loewenstein D. Prelec 2008 Coherent arbitrariness: stable demand curves without stable preferences The Quarterly Journal of Economics 118 73 105 10.1162/00335530360535153
8. K. J. Arrow 1950 A difficulty in the concept of social welfare Journal of Political Economy 58 328 346 10.1086/256963
9. Balcan, M.-F., Bansal, N., Beygelzimer, A., Coppersmith, D., Langford, J., & Sorkin, G. B. (2007). Robust reductions from ranking to classification. In COLT (pp. 604-619). Berlin: Springer.
10. M.-F. Balcan N. Bansal A. Beygelzimer D. Coppersmith J. Langford G. B. Sorkin 2008 Robust reductions from ranking to classification Machine Learning Journal 72 139 153 10.1007/s10994-008-5058-6
11. S. Clémençon N. Vayatis 2007 Ranking the best instances Journal of Machine Learning Research 8 2671 2699
12. W. W. Cohen R. E. Schapire Y. Singer 1999 Learning to order things The Journal of Artificial Intelligence Research 10 243 270 0915.68031 1692680
13. Coppersmith, D., Fleischer, L., & Rudra, A. (2006). Ordering by weighted number of wins gives a good ranking for weighted tournaments. In Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA).
14. Cortes, C., Mohri, M., & Rastogi, A. (2007a). An alternative ranking problem for search engines. In Proceedings of the 6th workshop on experimental algorithms (WEA 2007) (pp. 1-21). Heidelberg: Springer-Verlag.
15. Cortes, C., Mohri, M., & Rastogi, A. (2007b). Magnitude-preserving ranking algorithms. In Proceedings of the twenty-fourth international conference on machine learning (ICML 2007). Oregon State University, Corvallis, OR.
16. Cossock, D., & Zhang, T. (2006). Subset ranking using regression. In COLT (pp. 605-619).
17. Crammer, K., & Singer, Y. (2001). Pranking with ranking. In Advances in neural information processing systems : Vol. 14. Neural information processing systems: natural and synthetic, NIPS 2001 (pp. 641-647). Vancouver, British Columbia, Canada, December 3-8, 2001. Cambridge: MIT Press.
18. Y. Freund R. D. Iyer R. E. Schapire Y. Singer 2003 An efficient boosting algorithm for combining preferences Journal of Machine Learning Research 4 933 969 10.1162/jmlr.2003.4.6.933 2125342
19. J. A. Hanley B. J. McNeil 1982 The meaning and use of the area under a receiver operating characteristic (ROC) curve Radiology 143 29 36
20. Hedge, R., Jain, K., Williamson, D. P., & van Zuylen, A. (2007). Deterministic pivoting algorithms for constrained ranking and clustering problems. In Proceedings of the ACM-SIAM symposium on discrete algorithms (SODA).
21. C. Hoare 1961 Quicksort: Algorithm 64 Communications of the ACM 4 321 322 10.1145/366622.366644
22. Joachims, T. (2002). Optimizing search engines using clickthrough data. In KDD '02: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 133-142). New York: ACM Press.
23. Kenyon-Mathieu, C., & Schudy, W. (2007). How to rank with few errors. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on theory of computing (pp. 95-103). New York: ACM Press. (Pubitemid 47630725)
24. Lehmann, E. L. (1975). Nonparametrics: statistical methods based on ranks. San Francisco: Holden-Day.
25. Montague, M. H., & Aslam, J. A. (2002). Condorcet fusion for improved retrieval. In Proceedings of the 2002 ACM CIKM international conference on information and knowledge management (pp. 538-548). McLean, VA, USA, November 4-9, 2002. New York: ACM.
26. Rudin, C., Cortes, C., Mohri, M., & Schapire, R. E. (2005). Margin-based ranking meets boosting in the middle. In Learning theory, 18th annual conference on learning theory, COLT 2005 Proceedings (pp. 63-78). Bertinoro, Italy, June 27-30, 2005. Berlin: Springer.
27. Williamson, D. P., & van Zuylen, A. (2007). Deterministic algorithms for rank aggregation and other ranking and clustering problems. In Proceedings of the 5th workshop on approximation and online algorithms (WAOA).