{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:26Z","timestamp":1725486086316},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729259"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72927-3_27","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"365-377","source":"Crossref","is-referenced-by-count":0,"title":["Generalized SMO-Style Decomposition Algorithms"],"prefix":"10.1007","author":[{"given":"Nikolas","family":"List","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/72.857780","volume":"11","author":"C.-C. Chang","year":"2000","unstructured":"Chang, C.-C., Hsu, C.-W., Lin, C.-J.: The Analysis of Decomposition Methods for Support Vector Machines. IEEE Transaction on Neural Networks\u00a011(4), 1003\u20131008 (2000)","journal-title":"IEEE Transaction on Neural Networks"},{"key":"27_CR2","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM: A Library for Support Vector Machines, (2001)Software available at http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm"},{"issue":"9","key":"27_CR3","doi-asserted-by":"publisher","first-page":"2119","DOI":"10.1162\/089976601750399335","volume":"10","author":"C.-C. Chang","year":"2001","unstructured":"Chang, C.-C., Lin, C.-J.: Training \u03bd- Support Vector Classifiers: Theory and Algorithms. Neural Computation\u00a010(9), 2119\u20132147 (2001)","journal-title":"Neural Computation"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/TNN.2006.875973","volume":"17","author":"P.-H. Chen","year":"2006","unstructured":"Chen, P.-H., Fan, R.-E., Lin, C.-J.: A study on SMO-type Decomposition Methods for Support Vector Machines. IEEE Transactions on Neural Networks\u00a017, 893\u2013908 (2006)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"27_CR5","unstructured":"Collobert, R.: Large Scale Machine Learning. PhD thesis, Universit\u00e9 de Paris VI, LIP6 (2004)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1162\/15324430152733142","volume":"1","author":"R. Collobert","year":"2001","unstructured":"Collobert, R., Bengio, S.: SVMTorch: Support Vector Machines for Large-Scale Regression Problems. Journal of Machine Learning Research\u00a01, 143\u2013160 (2001)","journal-title":"Journal of Machine Learning Research"},{"key":"27_CR7","first-page":"733","volume":"7","author":"D. Hush","year":"2006","unstructured":"Hush, D., Kelly, P., Scovel, C., Steinwart, I.: QP Algorithms with Guaranteed Aaccuracy and Run Time for Support Vector Machines. Journal of Machine Learning Research\u00a07, 733\u2013769 (2006)","journal-title":"Journal of Machine Learning Research"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1021877911972","volume":"51","author":"D. Hush","year":"2003","unstructured":"Hush, D., Scovel, C.: Polynomial-time Decomposition Algorithms for Support Vector Machines. Machine Learning\u00a051, 51\u201371 (2003)","journal-title":"Machine Learning"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1012431217818","volume":"46","author":"S.S. Keerthi","year":"2002","unstructured":"Keerthi, S.S., Gilbert, E.G.: Convergence of a Generalized SMO Algorithm for SVM Classifier Design. Machine Learning\u00a046, 351\u2013360 (2002)","journal-title":"Machine Learning"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/72.963765","volume":"12","author":"C.-J. Lin","year":"2001","unstructured":"Lin, C.-J.: On the Convergence of the Decomposition Method for Support Vector Machines. IEEE Transactions on Neural Networks\u00a012, 1288\u20131298 (2001)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"List, N.: Convergence of a generalized gradient selection approach for the decomposition method. In: Proceedings of the 15th International Conference on Algorithmic Learning Theory, pp. 338\u2013349 (2004)","DOI":"10.1007\/978-3-540-30215-5_26"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"List, N., Simon, H.U.: A General Convergence Theorem for the Decomposition Method. In: Proceedings of the 17th Annual Conference on Learning Theory, COLT 2004, pp. 363\u2013377 (2004)","DOI":"10.1007\/978-3-540-27819-1_25"},{"key":"27_CR13","first-page":"303","volume":"8","author":"N. List","year":"2006","unstructured":"List, N., Simon, H.U.: General Polynomial Time Decomposition Algorithms. Journal of Machine Learning Research\u00a08, 303\u2013321 (2006)","journal-title":"Journal of Machine Learning Research"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Platt, J.C.: Fast Training of Support Vector Machines using Sequential Minimal Optimization. In: Sch\u00f6lkopf, B., Burges, C. J. C., Smola, A.\u00a0J., (eds.). Advances in Kernel Methods \u2013 Support Vector Learning. Cambridge, MA (1999)","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"27_CR15","volume-title":"Learning with Kernels","author":"B. Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., Smola, A.J.: Learning with Kernels, 2nd edn. MIT Press, Cambridge, MA, London (2002)","edition":"2"},{"issue":"5","key":"27_CR16","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1162\/089976600300015565","volume":"12","author":"B. Sch\u00f6lkopf","year":"2000","unstructured":"Sch\u00f6lkopf, B., Smola, A.J., Williamson, R., Bartlett, P.: New Support Vector Algorithms. Neural Computation\u00a012(5), 1207\u20131245 (2000)","journal-title":"Neural Computation"},{"key":"27_CR17","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-540-30215-5_25","volume-title":"Proceedings of the 15th International Conference on Algorithmic Learning Theory","author":"H.U. Simon","year":"2004","unstructured":"Simon, H.U.: On the Complexity of Working Set Selection. In: Proceedings of the 15th International Conference on Algorithmic Learning Theory, pp. 324\u2013337. Springer, Heidelberg (2004)"},{"key":"27_CR18","unstructured":"Szedmak, S., Shawe-Taylor, J., Parado-Hernandez, E.: Learning via Linear Operators: Maximum Margin Regression. Technical report (2006), available at http:\/\/eprints.pascal-network.org\/archive\/00001765\/"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T10:40:49Z","timestamp":1683888049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729259"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_27","relation":{},"subject":[]}}