Large-scale linear rankSVM

Neural Computation

Volumn 26, Issue 4, 2014, Pages 781-817

  Lee, Ching Pei ^a   Lin, Chih Jen ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTIFICIAL INTELLIGENCE; DECISION TREE; HUMAN; LEARNING; LETTER; STATISTICAL MODEL; THEORETICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DECISION TREES; HUMANS; LEARNING; LINEAR MODELS; MODELS, THEORETICAL;

EID: 84896829783     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/NECO_a_00571     Document Type: Letter

References (39)

1. Adelson-Velsky, G. M., & Landis, E. M. (1962). An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences, 146, 263-266.
2. Airola, A., Pahikkala, T., & Salakoski, T. (2011). Training linear ranking SVMs in linearithmic time using red-black trees. Pattern Recognition Letters, 32(9), 1328-1336.
3. Andersson, A. (1993). Balanced search trees made simple. In Proceedings of the Third Workshop on Algorithms and Data Structures (pp. 60-71).
4. Bayer, R. (1972). Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1, 290-306.
5. Boser, B. E., Guyon, I., & Vapnik, V. (1992). A training algorithm for optimal margin classifiers. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (pp. 144-152). New York: ACM Press.
6. Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5-32.
7. Burges, C. J. C. (2010). From RankNet to LambdaRank to LambdaMART: An overview (Technical Report MSR-TR-2010-82). Microsoft Research.
8. Chapelle, O., & Chang, Y. (2011). Yahoo! learning to rank challenge overview. In JMLR Workshop and Conference Proceedings: Workshop on Yahoo! Learning to Rank Challenge (Vol. 14, pp. 1-24).
9. Chapelle, O., & Keerthi, S. S. (2010). Efficient algorithms for ranking with SVMs. Information Retrieval, 13(3), 201-215.
10. Christensen, D. (2005). Fast algorithms for the calculation of Kendall's τ. Computational Statistics, 20, 51-62.
11. Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000). Trust-region methods. Philadelphia: Society for Industrial and Applied Mathematics.
12. Cortes, C., & Vapnik, V. (1995). Support-vector network. Machine Learning, 20, 273-297.
13. Fan, R.-E., Chang, K.-W., Hsieh, C.-J., Wang, X.-R., & Lin, C.-J. (2008). LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research, 9, 1871-1874.
14. Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189-1232.
15. Heger, D. A. (2004). A disquisition on the performance behavior of binary search tree data structures. European Journal for the Informatics Professional, 5(5), 67-75.
16. Herbrich, R., Graepel, T., & Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. In P. J. Bartlett, B. Scḧolkopf, D. Schuurmans, & A. J. Smola (Eds.), Advances in large margin classifiers (pp. 115-132). Cambridge, MA: MIT Press.
17. Ho, C.-H., & Lin, C.-J. (2012). Large-scale linear support vector regression. Journal of Machine Learning Research, 13, 3323-3348.
18. J̈arvelin, K., & Kek̈al̈ainen, J. (2002). Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems, 20(4), 422-446.
19. Joachims, T. (2005).Asupport vector method formultivariate performance measures. In Proceedings of the Twenty Second International Conference on Machine Learning (ICML).
20. Joachims, T. (2006). Training linear SVMs in linear time. In Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
21. Keerthi, S. S., & DeCoste, D. (2005). A modified finite Newton method for fast solution of large scale linear SVMs. Journal of Machine Learning Research, 6, 341-361.
22. Kendall, M. G. (1938). A newmeasure of rank correlation. Biometrika, 30(1/2), 81-93.
23. Knuth, D. E. (1973). The art of computer programming. Reading, MA: Addison-Wesley.
24. Lin, C.-J., & Moŕe, J. J. (1999). Newton's method for large-scale bound constrained problems. SIAM Journal on Optimization, 9, 1100-1127.
25. Lin, C.-J., Weng, R. C., & Keerthi, S. S. (2008). Trust region Newton method for large-scale logistic regression. Journal of Machine Learning Research, 9, 627-650.
26. Lin, K.-Y. (2010). Data selection techniques for large-scale rankSVM. Master's thesis, National Taiwan University.
27. Mangasarian, O. L. (2002). A finite Newton method for classification. Optimization Methods and Software, 17(5), 913-929.
28. Mohan, A., Chen, Z., & Weinberger, K. (2011). Web-search ranking with initialized gradient boosted regression trees. In JMLR Workshop and Conference Proceedings: Workshop on Yahoo! Learning to Rank Challenge (Vol. 14, pp. 77-89).
29. Niu, Y., Wang, Y., Sun, G., Yue, A., Dalessandro, B., Perlich, C., & Hamner, B. (2012). The Tencent dataset and KDD-Cup12. In ACM SIGKDD KDD-Cup WorkShop.
30. Qin, T., Liu, T.-Y., Xu, J., & Li, H. (2010). LETOR: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval, 13(4), 346-374.
31. Sculley, D. (2009). Large scale learning to rank. In NIPS 2009 Workshop on Advances in Ranking.
32. Shalev-Shwartz, S., Singer, Y., & Srebro, N. (2007). Pegasos: Primal estimated subgradient solver for SVM. In Proceedings of the Twenty Fourth International Conference on Machine Learning (ICML).
33. Steihaug, T. (1983). The conjugate gradient method and trust regions in large scale optimization. SIAM Journal on Numerical Analysis, 20, 626-637.
34. Teo, C. H., Vishwanathan, S., Smola, A., & Le, Q. V. (2010). Bundle methods for regularized risk minimization. Journal of Machine Learning Research, 11, 311-365.
35. Tyree, S., Weinberger, K. Q., Agrawal, K., & Paykin, J. (2011). Parallel boosted regression trees for web search ranking. In Proceedings of the 20th International Conference on World Wide Web (pp. 387-396).
36. Vapnik, V. (1995). The nature of statistical learning theory. New York: Springer-Verlag.
37. Wu, K.-W., Ferng, C.-S., Ho, C.-H., Liang, A.-C., Huang, C.-H., Shen, W.-Y.,.. Lin, H.-T. (2012). A two-stage ensemble of diverse models for advertisement ranking in KDD Cup 2012. In ACM SIGKDD KDD-Cup WorkShop. NewYork.
38. Yuan, G.-X., Ho, C.-H., & Lin, C.-J. (2012). Recent advances of large-scale linear classification. Proceedings of the IEEE, 100(9), 2584-2603.
39. Zheng, Z., Chen, K., Sun, G., & Zha, H. (2007). A regression framework for learning ranking functions using relative relevance judgments. In Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 287-294). New York: ACM.