{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T04:45:51Z","timestamp":1771649151704,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Texas A&M High Performance Research Computing."}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2019,5,1]]},"DOI":"10.1109\/tpds.2018.2879950","type":"journal-article","created":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T19:26:01Z","timestamp":1541618761000},"page":"1065-1076","source":"Crossref","is-referenced-by-count":23,"title":["Fast and Communication-Efficient Algorithm for Distributed Support Vector Machine Training"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7552-8753","authenticated-orcid":false,"given":"Jyotikrishna","family":"Dass","sequence":"first","affiliation":[]},{"given":"Vivek","family":"Sarin","sequence":"additional","affiliation":[]},{"given":"Rabi N.","family":"Mahapatra","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"733","article-title":"QP algorithms with guaranteed accuracy and run time for support vector machines","volume":"7","author":"hush","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.222"},{"key":"ref12","first-page":"701","article-title":"Memory efficient kernel approximation","author":"si","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref13","first-page":"243","article-title":"Efficient SVM training using low-rank kernel representations","volume":"2","author":"fine","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref14","first-page":"911","article-title":"Sparse greedy matrix approximation for machine learning","author":"smola","year":"2000","journal-title":"Proc 17th Int Conf Mach Learn"},{"key":"ref15","first-page":"2153","article-title":"On the Nyström method for approximating a gram matrix for improved kernel-based learning","volume":"6","author":"drineas","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref16","first-page":"499","article-title":"Stability and generalization","volume":"2","author":"bousquet","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/320941.320947"},{"key":"ref19","first-page":"1251","article-title":"Algorithms for the QR decomposition","volume":"80","author":"gander","year":"1980","journal-title":"Res Rep"},{"key":"ref4","first-page":"169","article-title":"Making large-scale support vector machine learning practical","author":"joachims","year":"1999","journal-title":"Advances in Kernel Methods"},{"key":"ref3","first-page":"21","article-title":"Sequential minimal optimization: A fast algorithm for training support vector machines","author":"platt","year":"1998"},{"key":"ref6","first-page":"521","article-title":"Parallel support vector machines: The cascade SVM","author":"graf","year":"2004","journal-title":"Proc 17th Int Conf Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref8","first-page":"257","article-title":"PSVM: Parallelizing support vector machines on distributed computers","author":"chang","year":"2007","journal-title":"Proc 20th Int Conf Neural Inf Process Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.117"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390208"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009715923555"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.29"},{"key":"ref20","article-title":"18.335J - Introduction to Numerical Methods, Fall 2010","author":"johnson","year":"2010","journal-title":"Massachusetts Institute of Technology MIT OpenCourseWare"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/080731992"},{"key":"ref21","first-page":"3689","article-title":"Fast prediction for large-scale kernel machines","author":"hsieh","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref24","article-title":"MPI: A message-passing interface standard","author":"forum","year":"1994"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00026"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8685251\/08526323.pdf?arnumber=8526323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:44Z","timestamp":1657745564000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8526323\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,1]]},"references-count":24,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2018.2879950","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"value":"1045-9219","type":"print"},{"value":"1558-2183","type":"electronic"},{"value":"2161-9883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,1]]}}}