IntervalRank: Isotonic regression with listwise and pairwise constraints

WSDM 2010 - Proceedings of the 3rd ACM International Conference on Web Search and Data Mining

Volumn , Issue , 2010, Pages 151-159

  Moon, Taesup ^a   Smola, Alex ^a,b   Chang, Yi ^a   Zheng, Zhaohui ^a  

^a YAHOO RESEARCH   (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Isotonic regression; Learning to rank; Listwise constraints; Pairwise constraints

Indexed keywords

ADAPTIVE BANDWIDTH SELECTION; BASIC IDEA; DATA SETS; ISOTONIC REGRESSION; LEARNING TO RANK; LINEAR TIME; LOSS FUNCTIONS; MACHINE-LEARNING; PAIRWISE CONSTRAINTS; RANKING PERFORMANCE; RETRIEVED DOCUMENTS; SUBGRADIENT DESCENT; WEB SEARCHES;

INFORMATION RETRIEVAL; REGRESSION ANALYSIS; SEARCH ENGINES;

WORLD WIDE WEB;

EID: 77950957348     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1718487.1718507     Document Type: Conference Paper

References (26)

1. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge, England, 2004.
2. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hulldender. Learning to rank using gradient descent. In Proc. Intl. Conf. Machine Learning, 2005.
3. Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li. Learning to rank: from pairwise approach to listwise approach. In ICML '07: Proceedings of the 24th international conference on Machine learning, pages 129-136, New York, NY, USA, 2007. ACM.
4. D. Cossock and T. Zhang. Statistical analysis of bayes optimal subset ranking. IEEE Transactions on Information Theory, 54(11):5140-5154, 2008.
5. C. Do, Q. Le, and C. Foo. Proximal regularization for online and batch learning. In International Conference on Machine Learning ICML, 2009.
6. Y. Freund, R. Iyer, R. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969, 2003.
7. J. Friedman. Greedy function approximation: a gradient boosting machine. Technical report, Stanford University, 1999.
8. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: A statistical view of boosting. The Annals of Statistics, 28(2):337-374, 2000.
9. R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. In A. J. Smola, P. L. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 115-132, Cambridge, MA, 2000. MIT Press.
10. T. Joachims. Optimizing search engines using clickthrough data. In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD). ACM, 2002.
11. D. Liu and J. Nocedal. On the limited memory BFGS method for large scale optimization. Mathematical Programming, 45(3):503-528, 1989.
12. T. Y. Liu. Learning to Rank for Information Retrieval. Now Publishers, 2009.
13. T.-Y. Liu, J. Xu, T. Qin, W. Xiong, and H. Li. Letor: Benchmark dataset for research on learning to rank for information retrieval. In LR4IR 2007, in conjunction with SIGIR 2007, 2007.
14. L. Mason, J. Baxter, P. L. Bartlett, and M. Frean. Functional gradient techniques for combining hypotheses. In A. J. Smola, P. L. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 221-246, Cambridge, MA, 2000. MIT Press.
15. A. Smola, S. V. N. Vishwanathan, and Q. Le. Bundle methods for machine learning. In D. Koller and Y. Singer, editors, Advances in Neural Information Processing Systems 20, Cambridge MA, 2007. MIT Press.
16. M. Taylor, J. Guiver, S. Robertson, and T. Minka. SoftRank: Optimising non-smooth rank metrics. In Proceedings of International ACM Conference on Web Search and Data Mining, 2008.
17. M.-F. Tsai, T.-Y. Liu, T. Qin, H.-H. Chen, and W.-Y. Ma. FRank: A ranking method with fideltiy loss. In Proceedings of International ACM SIGIR Conference on Research and development in information retrieval, 2007.
18. R. J. Vanderbei. Linear Programming: Foundations and Extensions. Kluwer Academic, Hingham, 1997.
19. V. Vapnik and A. Chervonenkis. The necessary and sufficient conditions for consistency in the empirical risk minimization method. Pattern Recognition and Image Analysis, 1(3):283-305, 1991.
20. M. Weimer, A. Karatzoglou, Q. Le, and A. Smola. Cofi rank - maximum margin matrix factorization for collaborative ranking. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20. MIT Press, Cambridge, MA, 2008.
21. M. Wu, H. Zha, Z. Zheng, and Y. Chang. Smoothing DCG for learning to rank: A novel approach using smoothed hinge functions. In Proceedings of CIKM (Short Paper), 2009.
22. F. Xia, T. Y. Liu, J. Wang, W. Zhang, and H. Li. Listwise approach to learning to rank - Theory and algorithm. In International Conference on Machine Learning (ICML), 2008.
23. J. Xu and L. Hang. Adarank: a boosting algorithm for information retrieval. In SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pages 391-398, New York, NY, 2007. ACM Press.
24. Z. Zheng, H. Zha, K. Chen, and G. Sun. A regression framework for learning ranking functions using relative relevance judgments. In Proccedings of Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007.
25. Z. Zheng, H. Zha, and G. Sun. Query-level learning to rank using isotonic regression. In Proccedings of the 46th Annual Allerton Conference on Communication, Control and Computing. Allerton, IL, 2008.
26. Z. Zheng, H. Zha, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, pages 1697-1704. MIT Press, Cambridge, MA, 2008.