Conditional models for non-smooth ranking loss functions

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2009, Pages 129-138

  Dubey, Avinava ^a   Machchhar, Jinesh ^b   Bhattacharyya, Chiranjib ^b   Chakrabarti, Soumen ^a  

^a IBM RESEARCH INDIA   (India)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ACCURACY IMPROVEMENT; COMPETITIVE ALGORITHMS; CONDITIONAL MODELS; CONDITIONAL PROBABILITIES; CONVEX APPROXIMATION; DATA SETS; FEATURE VECTORS; GRADIENT-BASED OPTIMIZATION; LEARNING TO RANK; LOSS FUNCTIONS; LOSS MINIMIZATION; MACHINE-LEARNING; MONTE CARLO SAMPLING; NON-SMOOTH; OPTIMIZERS; QUASI-NEWTON; WEB SEARCHES;

INFORMATION RETRIEVAL; NEURAL NETWORKS; VECTOR SPACES; WORLD WIDE WEB;

OPTIMIZATION;

EID: 77951190798     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2009.49     Document Type: Conference Paper

References (20)

1. A. L. Berger, S. A. D. Pietra, and V. J. D. Pietra. A maximum entropy approach to natural language processing. Computational Linguistics, 22(1):3971, 1996.
2. C. M. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.
3. C. Burges. Learning to rank for Web search: Some new directions. Keynote talk at SIGIR Ranking Workshop, July 2007.
4. Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li. Learning to rank: From pairwise approach to listwise approach. In ICML, pages 129-136, 2007.
5. S. Chakrabarti, R. Khanna, U. Sawant, and C. Bhattacharyya. Structured learning for non-smooth ranking losses. In SIGKDD Conference, pages 88-96. ACM, 2008.
6. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969, 2003.
7. K. Järvelin and J. Kekäläinen. IR evaluation methods for retrieving highly relevant documents. In SIGIR Conference, pages 41-48, 2000.
8. T. Joachims. Optimizing search engines using clickthrough data. In SIGKDD Conference, pages 133-142. ACM, 2002.
9. T. Joachims. A support vector method for multivariate performance measures. In ICML, pages 377-384, 2005.
10. K. S. Jones, S. Walker, and S. E. Robertson. A probabilistic model of information retrieval: Development and comparative experiments (parts 1 and 2). Information Processing and Management, 36(6):779-840, 2000.
11. Q. V. Le and A. J. Smola. Direct optimization of ranking measures. arXiv:0704.3359v1, Feb. 2008.
12. D. C. Liu and J. Nocedal. On the limited memory BFGS method for large scale optimization. Math. Programming, 45(3, (Ser. B)):503-528, 1989.
13. T.-Y. Liu. Learning to rank for information retrieval. Tutorial at SIGIR, 2008.
14. T.-Y. Liu, T. Qin, J. Xu, W. Xiong, and H. Li. LETOR: Benchmark dataset for research on learning to rank for information retrieval. In LR4IR Workshop, 2007.
15. G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, 1983.
16. M. Taylor, J. Guiver, S. Robertson, and T. Minka. SoftRank: Optimising non-smooth rank metrics. In WSDM Conference. ACM, 2008.
17. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. JMLR, 6(Sep):1453-1484, 2005.
18. V. Vapnik, S. Golowich, and A. J. Smola. Support vector method for function approximation, regression estimation, and signal processing. In Advances in Neural Information Processing Systems. MIT Press, 1996.
19. M. N. Volkovs and R. S. Zemel. BoltzRank: Learning to maximize expected ranking gain. In ICML, 2009.
20. Y. Yue, T. Finley, F. Radlinski, and T. Joachims. A support vector method for optimizing average precision. In SIGIR Conference, pages 271-278, 2007.