{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:20:10Z","timestamp":1775913610590,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428756","type":"print"},{"value":"9783540455837","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45583-3_11","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"119-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["A Random Sampling Technique for Training Support Vector Machines"],"prefix":"10.1007","author":[{"given":"Jose","family":"Balc\u00e1zar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osamu","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01582137","volume":"61","author":"I. Adler","year":"1993","unstructured":"I. Adler and R. Shamir, A randomized scheme for speeding up algorithms for linear and convex programming with high constraints-to-variable ratio, Math. Programming 61, 39\u201352, 1993.","journal-title":"Math. Programming"},{"key":"11_CR2","unstructured":"J. Balc\u00e1zar, Y. Dai, and O. Watanabe, in preparation."},{"key":"11_CR3","unstructured":"K.P. Bennett and E.J. Bredensteiner, Duality and geometry in SVM classifiers, in Proc. the 17th Int\u2019l Conf. on Machine Learning (ICML\u20192000), 57\u201364, 2000."},{"key":"11_CR4","unstructured":"D.P. Bertsekas, Nonlinear Programming, Athena Scientific, 1995."},{"key":"11_CR5","unstructured":"P.S. Bradley, O.L. Mangasarian, and D.R. Musicant, Optimization methods in massive datasets, in Handbook of Massive Datasets (J. Abello, P.M. Pardalos, and M.G.C. Resende, eds.) Kluwer Academic Pub., 2000, to appear."},{"key":"11_CR6","unstructured":"C.J. Lin, On the convergence of the decomposition method for support vector machines, IEEE Trans. on Neural Networks, 2001, to appear."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"K.L. Clarkson","year":"1995","unstructured":"K.L. Clarkson, Las Vegas algorithms for linear and integer programming, J.ACM 42, 488\u2013499, 1995.","journal-title":"J.ACM"},{"key":"11_CR8","first-page":"273","volume":"20","author":"C. Cortes","year":"1995","unstructured":"C. Cortes and V. Vapnik, Support-vector networks, Machine Learning 20, 273\u2013297, 1995.","journal-title":"Machine Learning"},{"key":"11_CR9","unstructured":"N. Cristianini and J. Shawe-Taylor, An Introduction to Support Vector Machines, Cambridge University Press 2000."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"B. G\u00e4rtner and E. Welzl, A simple sampling lemma: Analysis and applications in geometric optimization, Discr. Comput. Geometry, 2000, to appear.","DOI":"10.1145\/336154.336186"},{"key":"11_CR11","unstructured":"S.S. Keerthi and E.G. Gilbert, Convergence of a generalized SMO algorithm for SVM classifier design, Technical Report CD-00-01, Dept. of Mechanical and Production Eng., National University of Singapore, 2000."},{"key":"11_CR12","unstructured":"E. Osuna, R. Freund, and F. Girosi, An improved training algorithm for support vector machines, in Proc. IEEE Workshop on Neural Networks for Signal Processing, 276\u2013285, 1997."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"J. Platt, Fast training of support vector machines using sequential minimal optimization, in Advances in Kernel Methods-Support Vector Learning (B. Scholkopf, C.J.C. Burges, and A.J. Smola, eds.), MIT Press, 185\u2013208, 1999.","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"11_CR14","unstructured":"A.J. Smola and B. Scholkopf, A tutorial on support vector regression, NeuroCOLT Technical Report NC-TR-98-030, Royal Holloway College, University of London, 1998."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T12:46:39Z","timestamp":1684068399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_11"}},"subtitle":["For Primal-Form Maximal-Margin Classifiers"],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}