{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:16:03Z","timestamp":1761401763016,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T00:00:00Z","timestamp":1440633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472454"],"award-info":[{"award-number":["61472454"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Department of Education of Guangdong Province","award":["2013KJCX0128"],"award-info":[{"award-number":["2013KJCX0128"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s11227-015-1509-6","type":"journal-article","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T05:55:21Z","timestamp":1440568521000},"page":"4141-4171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["GPU-accelerated parallel algorithms for linear rankSVM"],"prefix":"10.1007","volume":"71","author":[{"given":"Jing","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianggao","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoming","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaola","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"issue":"9","key":"1509_CR1","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1016\/j.patrec.2011.03.014","volume":"32","author":"A Airola","year":"2011","unstructured":"Airola A, Pahikkala T, Salakoski T (2011) Training linear ranking svms in linearithmic time using red-black trees. Pattern Recogn Lett 32(9):1328\u20131336","journal-title":"Pattern Recogn Lett"},{"key":"1509_CR2","doi-asserted-by":"crossref","unstructured":"Burges C, Shaked T, Renshaw E, Lazier A, Deeds M, Hamilton N, Hullender G (2005) Learning to rank using gradient descent. In: Proceedings of the 22nd international conference on Machine learning, ACM, pp 89\u201396","DOI":"10.1145\/1102351.1102363"},{"key":"1509_CR3","doi-asserted-by":"crossref","unstructured":"Cederman D, Tsigas P (2008) A practical quicksort algorithm for graphics processors. In: Proceedings of the 16th Annual European Symposium on Algorithms (ESA 2008), Springer, pp 246\u2013258","DOI":"10.1007\/978-3-540-87744-8_21"},{"key":"1509_CR4","first-page":"1","volume":"14","author":"O Chapelle","year":"2011","unstructured":"Chapelle O, Chang Y (2011) Yahoo! learning to rank challenge overview. J Mach Learn Res Proc Track 14:1\u201324","journal-title":"J Mach Learn Res Proc Track"},{"issue":"3","key":"1509_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10791-009-9109-9","volume":"13","author":"O Chapelle","year":"2010","unstructured":"Chapelle O, Keerthi SS (2010) Efficient algorithms for ranking with svms. Inf Retr 13(3):201\u2013215","journal-title":"Inf Retr"},{"key":"1509_CR6","doi-asserted-by":"crossref","unstructured":"Conn AR, Gould NI, Toint PL (2000) Trust region methods. SIAM, philadelphia","DOI":"10.1137\/1.9780898719857"},{"key":"1509_CR7","doi-asserted-by":"crossref","unstructured":"Cooper WS, Gey FC, Dabney DP (1992) Probabilistic retrieval based on staged logistic regression. In: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval, ACM, pp 198\u2013210","DOI":"10.1145\/133160.133199"},{"issue":"3","key":"1509_CR8","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273\u2013297","journal-title":"Mach Learn"},{"key":"1509_CR9","first-page":"1871","volume":"9","author":"RE Fan","year":"2008","unstructured":"Fan RE, Chang KW, Hsieh CJ, Wang XR, Lin CJ (2008) Liblinear: a library for large linear classification. J Mach Learn Res 9:1871\u20131874","journal-title":"J Mach Learn Res"},{"key":"1509_CR10","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund Y, Iyer R, Schapire RE, Singer Y (2003) An efficient boosting algorithm for combining preferences. J Mach Learn Res 4:933\u2013969","journal-title":"J Mach Learn Res"},{"issue":"3","key":"1509_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/65943.65944","volume":"7","author":"N Fuhr","year":"1989","unstructured":"Fuhr N (1989) Optimum polynomial retrieval functions based on the probability ranking principle. ACM Trans Inf Syst (TOIS) 7(3):183\u2013204","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"1509_CR12","unstructured":"Govindaraju NK, Raghuvanshi N, Henson M, Manocha D (2005) A cache-efficient sorting algorithm for database and data mining computations using graphics processors. University of North Carolina, Technical Report. http:\/\/gamma.cs.unc.edu\/SORT\/gpusort.pdf"},{"issue":"4","key":"1509_CR13","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin K, Kek\u00e4l\u00e4inen J (2002) Cumulated gain-based evaluation of ir techniques. ACM Trans Inf Syst (TOIS) 20(4):422\u2013446","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"1509_CR14","doi-asserted-by":"crossref","unstructured":"Jin J, Lin X (2014) Efficient parallel algorithms for linear rankSVM on gpu. In: Proceedings of the 11 th IFIP WG 10.3 international conference on Network and parallel computing, Springer, pp 181\u2013194","DOI":"10.1007\/978-3-662-44917-2_16"},{"key":"1509_CR15","doi-asserted-by":"crossref","unstructured":"Joachims T (2002) Optimizing search engines using clickthrough data. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 133\u2013142","DOI":"10.1145\/775047.775067"},{"issue":"1","key":"1509_CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10994-009-5108-8","volume":"77","author":"T Joachims","year":"2009","unstructured":"Joachims T, Finley T, Yu CNJ (2009) Cutting-plane training of structural svms. Mach Learn 77(1): 27\u201359","journal-title":"Mach Learn"},{"key":"1509_CR17","doi-asserted-by":"crossref","unstructured":"Kuo TM, Lee CP, Lin CJ (2014) Large-scale kernel rankSVM. In: Proceedings of the 2014 society for industrial and applied mathematics (SIAM) international conference on data mining, SIMA, pp 812\u2013820","DOI":"10.1137\/1.9781611973440.93"},{"key":"1509_CR18","unstructured":"Lee CP, Lin CJ (2014) Large-scale linear ranksvm. Neural Comput pp 26(4):781\u2013817"},{"key":"1509_CR19","first-page":"627","volume":"9","author":"CJ Lin","year":"2008","unstructured":"Lin CJ, Weng RC, Keerthi SS (2008) Trust region newton method for logistic regression. J Mach Learn Res 9:627\u2013650","journal-title":"J Mach Learn Res"},{"issue":"02","key":"1509_CR20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1142\/S0129626411000187","volume":"21","author":"D Merrill","year":"2011","unstructured":"Merrill D, Grimshaw A (2011) High performance and scalable radix sorting: a case study of implementing dynamic parallelism for gpu computing. Parallel Process Lett 21(02):245\u2013272","journal-title":"Parallel Process Lett"},{"key":"1509_CR21","unstructured":"NVIDA CUDA (2007) Compute unified device architecture programming guide. NVIDIA, Santa Clara, CA"},{"key":"1509_CR22","unstructured":"NVIDA CUDA (2007) Cublas library programming guide, 1st edn. NVIDA Corporation. http:\/\/docs.nvidia.com\/cuda\/cublas"},{"key":"1509_CR23","unstructured":"NVIDA CUDA (2008) CUDA programming guide 2.1. NVIDIA Corporation. http:\/\/www.umiacs.umd.edu\/~ramani\/cmsc828e_gpusci\/CUDA21.pdf"},{"issue":"5","key":"1509_CR24","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/JPROC.2008.917757","volume":"96","author":"JD Owens","year":"2008","unstructured":"Owens JD, Houston M, Luebke D, Green S, Stone JE, Phillips JC (2008) Gpu computing. Proc IEEE 96(5):879\u2013899","journal-title":"Proc IEEE"},{"key":"1509_CR25","doi-asserted-by":"crossref","unstructured":"Richardson M, Prakash A, Brill E (2006) Beyond pagerank: machine learning for static ranking. In: Proceedings of the 15th international conference on World Wide Web, ACM, pp 707\u2013715","DOI":"10.1145\/1135777.1135881"},{"key":"1509_CR26","unstructured":"Sculley D (2009) Large scale learning to rank. In: Proceedings of the neural information processing systems 2009 workshop on advances in ranking, pp 1\u20136"},{"key":"1509_CR27","doi-asserted-by":"crossref","unstructured":"Steinkraus D, Buck I, Simard P (2005) Using gpus for machine learning algorithms. In: Document analysis and recognition, proceedings of 8th international conference on, IEEE, pp 1115\u20131120","DOI":"10.1109\/ICDAR.2005.251"},{"key":"1509_CR28","unstructured":"Valizadegan H, Jin R, Zhang R, Mao J (2009) Learning to rank by optimizing ndcg measure. In: Advances in neural information processing systems 22 (NIPS 2009), Curran Associates Inc., pp 1833\u20131891"},{"key":"1509_CR29","unstructured":"Wu Q, Burges CJ, Svore KM, Gao J (2008) Ranking, boosting, and model adaptation. Microsoft Research Technical Report, MSR-TR-2008-109. http:\/\/research.microsoft.com\/pubs\/69536\/tr-2008-109.pdf"},{"key":"1509_CR30","doi-asserted-by":"crossref","unstructured":"Yu H, Kim Y, Hwang S (2009) Rv-svm: an efficient method for learning ranking svm. In: Proceedings of the 13 th Pacific-Asia knowledge discovery and data mining conference (PAKDD 2009), Springer, pp 426\u2013438","DOI":"10.1007\/978-3-642-01307-2_39"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1509-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-015-1509-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1509-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T17:04:31Z","timestamp":1567098271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-015-1509-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,27]]},"references-count":30,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1509"],"URL":"https:\/\/doi.org\/10.1007\/s11227-015-1509-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2015,8,27]]}}}