{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T14:38:33Z","timestamp":1774190313363,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,9,9]],"date-time":"2009-09-09T00:00:00Z","timestamp":1252454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,9,9]],"date-time":"2009-09-09T00:00:00Z","timestamp":1252454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10791-009-9109-9","type":"journal-article","created":{"date-parts":[[2009,9,8]],"date-time":"2009-09-08T21:53:04Z","timestamp":1252446784000},"page":"201-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":198,"title":["Efficient algorithms for ranking with SVMs"],"prefix":"10.1007","volume":"13","author":[{"given":"O.","family":"Chapelle","sequence":"first","affiliation":[]},{"given":"S. S.","family":"Keerthi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,9]]},"reference":[{"key":"9109_CR1","first-page":"821","volume":"25","author":"M. Aizerman","year":"1964","unstructured":"Aizerman, M., Braverman, E., & Rozonoer, L. (1964). Theoretical foundations of the potential function method in pattern recognition learning. Automation and Remote Control, 25, 821\u2013837.","journal-title":"Automation and Remote Control"},{"key":"9109_CR2","doi-asserted-by":"crossref","unstructured":"Barrett, R., & Romine, C. (1994). Templates for the solution of linear systems: Building blocks for iterative methods. Society for Industrial Mathematics.","DOI":"10.1137\/1.9781611971538"},{"key":"9109_CR3","unstructured":"Bottou, L., & Bousquet, O. (2008). The tradeoffs of large scale learning. In J. Platt, D. Koller, Y. Singer, & S. Roweis (Eds.), Advances in neural information processing systems (Vol. 20, pp. 161\u2013168)."},{"key":"9109_CR5","doi-asserted-by":"crossref","unstructured":"Burges, C. J., Le, Q. V., & Ragno, R. (2007). Learning to rank with nonsmooth cost functions. In B. Sch\u00f6lkopf, J. Platt, & T. Hofmann (Eds.), Advances in neural information processing systems (Vol. 19).","DOI":"10.7551\/mitpress\/7503.003.0029"},{"key":"9109_CR4","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., et al. (2005). Learning to rank using gradient descent. In Proceedings of the international conference on machine learning.","DOI":"10.1145\/1102351.1102363"},{"key":"9109_CR6","doi-asserted-by":"crossref","unstructured":"Cao, Y., Xu, J., Liu, T. Y., Li, H., Huang, Y., & Hon, H. W. (2006). Adapting ranking SVM to document retrieval. In SIGIR.","DOI":"10.1145\/1148170.1148205"},{"key":"9109_CR7","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T. Y., Tsai, M. F., & Li, H. (2007). Learning to rank: From pairwise approach to listwise approach. In International conference on machine learning.","DOI":"10.1145\/1273496.1273513"},{"key":"9109_CR8","unstructured":"Chapelle, O. (2007a). Optimization techniques for support vector machines. Talk at the workshop on Numerical tools and fast algorithms for massive data mining, search engines and applications, UCLA, http:\/\/www.ipam.ucla.edu\/publications\/sews2\/sews2_7130.pdf"},{"issue":"5","key":"9109_CR9","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1162\/neco.2007.19.5.1155","volume":"19","author":"O. Chapelle","year":"2007","unstructured":"Chapelle, O. (2007b). Training a support vector machine in the primal. Neural Computation, 19(5), 1155\u20131178.","journal-title":"Neural Computation"},{"key":"9109_CR10","doi-asserted-by":"crossref","unstructured":"Cossock, D., & Zhang, T. (2006). Subset ranking using regression. In Proceedings of the 19th annual conference on learning theory. Lecture notes in computer science (Vol. 4005, pp. 605\u2013619). Berlin: Springer.","DOI":"10.1007\/11776420_44"},{"issue":"2","key":"9109_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"R. Dembo","year":"1983","unstructured":"Dembo, R., & Steihaug, T. (1983). Truncated-newton algorithms for large-scale unconstrained optimization. Mathematical Programming, 26(2), 190\u2013212.","journal-title":"Mathematical Programming"},{"key":"9109_CR12","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1162\/jmlr.2003.4.6.933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933\u2013969.","journal-title":"Journal of Machine Learning Research"},{"key":"9109_CR13","unstructured":"Grinspan, P. (2007). A connection between DCG and a pairwise-defined loss function, Internal Yahoo! memo."},{"key":"9109_CR14","doi-asserted-by":"crossref","unstructured":"Herbrich, R., Graepel, T., & Obermayer, K. (2000) Large margin rank boundaries for ordinal regression. In B. Smola & S. Schoelkopf (Eds.), Advances in large margin classifiers. Cambridge, MA: MIT Press.","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"9109_CR15","doi-asserted-by":"crossref","unstructured":"Joachims, T. (2002). Optimizing search engines using clickthrough data. In Proceedings of the ACM conference on knowledge discovery and data mining (KDD), ACM.","DOI":"10.1145\/775047.775067"},{"key":"9109_CR16","doi-asserted-by":"crossref","unstructured":"Joachims, T. (2005). A support vector method for multivariate performance measures. In International conference on machine learning (ICML), pp. 377\u2013384.","DOI":"10.1145\/1102351.1102399"},{"key":"9109_CR17","doi-asserted-by":"crossref","unstructured":"Joachims, T. (2006). Training linear SVMs in linear time. In ACM SIGKDD International conference on knowledge discovery and data mining (KDD), pp. 217\u2013226.","DOI":"10.1145\/1150402.1150429"},{"key":"9109_CR18","first-page":"341","volume":"6","author":"S. S. Keerthi","year":"2005","unstructured":"Keerthi, S. S., & DeCoste, D. M. (2005). A modified finite Newton method for fast solution of large scale linear SVMs. Journal of Machine Learning Research, 6, 341\u2013361.","journal-title":"Journal of Machine Learning Research"},{"issue":"6","key":"9109_CR19","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.1109\/TNN.2007.900229","volume":"18","author":"S. S. Keerthi","year":"2007","unstructured":"Keerthi, S. S., & Shevade, S. (2007). A fast tracking algorithm for generalized LARS\/LASSO. IEEE Transactions on Neural Networks, 18(6), 1826\u20131830.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"9109_CR20","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1214\/aoms\/1177697089","volume":"41","author":"G. S. Kimeldorf","year":"1970","unstructured":"Kimeldorf, G. S., & Wahba, G. (1970). A correspondence between bayesian estimation on stochastic processes and smoothing by splines. Annals of Mathematical Statistics, 41, 495\u2013502.","journal-title":"Annals of Mathematical Statistics"},{"key":"9109_CR21","first-page":"361","volume":"5","author":"D. Lewis","year":"2004","unstructured":"Lewis, D., Yang, Y., Rose, T., & Li, F. (2004). Rcv1: A new benchmark collection for text categorization research. Journal of Machine Learning Research, 5, 361\u2013397.","journal-title":"Journal of Machine Learning Research"},{"key":"9109_CR22","unstructured":"Liu, T. Y., Xu, J., Qin, T., Xiong, W., & Li, H. (2007). Letor: Benchmark dataset for research on learning to rank for information retrieval. In LR4IR 2007, in conjunction with SIGIR 2007."},{"key":"9109_CR23","unstructured":"MSR. (2008). Ranking SVM on LETOR. Microsoft Research Asia, http:\/\/www.research.microsoft.com\/en-us\/um\/beijing\/projects\/letor\/Baselines \/RankSVM.htm."},{"key":"9109_CR24","volume-title":"Learning with Kernels","author":"B. Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., & Smola, A. (2002). Learning with Kernels. Cambridge, MA: MIT Press."},{"key":"9109_CR25","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Singer, Y., & Srebro, N. (2007). Pegasos: Primal estimated sub-gradient solver for SVM. In Proceedings of the international conference on machine learning.","DOI":"10.1145\/1273496.1273598"},{"key":"9109_CR26","unstructured":"Shewchuk, J. R. (1994). An introduction to the conjugate gradient method without the agonizing pain. Tech. Rep. CMU-CS-94-125, School of Computer Science, Carnegie Mellon University."},{"key":"9109_CR27","first-page":"1453","volume":"6","author":"I. Tsochantaridis","year":"2005","unstructured":"Tsochantaridis, I., Joachims, T., Hofmann, T., & Altun, Y. (2005). Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6, 1453\u20131484.","journal-title":"Journal of Machine Learning Research"},{"key":"9109_CR28","unstructured":"Zheng. Z., Zha, H., Zhang, T., Chapelle, O., Chen, K., & Sun, G. (2008), A general boosting method and its application to learning ranking functions for web search. In Advances in neural information processing systems (Vol. 20, pp. 1697\u20131704). MIT Press."}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9109-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-009-9109-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9109-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9109-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:49:51Z","timestamp":1704206991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-009-9109-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,9]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9109"],"URL":"https:\/\/doi.org\/10.1007\/s10791-009-9109-9","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,9]]},"assertion":[{"value":"27 March 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2009","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2009","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}