{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T03:56:25Z","timestamp":1779162985859,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T00:00:00Z","timestamp":1207267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s10208-008-9026-0","type":"journal-article","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T16:19:54Z","timestamp":1207239594000},"page":"243-257","source":"Crossref","is-referenced-by-count":58,"title":["Analysis of Support Vector Machines Regression"],"prefix":"10.1007","volume":"9","author":[{"given":"Hongzhi","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Di-Rong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lizhong","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,4]]},"reference":[{"key":"9026_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1090\/S0002-9947-1950-0051437-7","volume":"68","author":"N. Aronszajn","year":"1950","unstructured":"N. Aronszajn, Theory of reproducing kernels, Trans. Am. Math. Soc. 68, 337\u2013404 (1950).","journal-title":"Trans. Am. Math. Soc."},{"key":"9026_CR2","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"P.L. Bartlett","year":"1998","unstructured":"P.L. Bartlett, The sample complexity of pattern classification with neural networks: The size of the weights is more import than the size of the network, IEEE Trans. Inf. Theory 44, 525\u2013536 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9026_CR3","first-page":"499","volume":"2","author":"O. Bousquet","year":"2002","unstructured":"O. Bousquet, A. Elisseeff, Stability and generalization, J. Mach. Learn. Res. 2, 499\u2013526 (2002).","journal-title":"J. Mach. Learn. Res."},{"key":"9026_CR4","first-page":"1143","volume":"5","author":"D.R. Chen","year":"2004","unstructured":"D.R. Chen, Q. Wu, Y. Ying, D.X. Zhou, Support vector machine soft margin classifiers: error analysis, J. Mach. Learn. Res. 5, 1143\u20131175 (2004).","journal-title":"J. Mach. Learn. Res."},{"key":"9026_CR5","doi-asserted-by":"crossref","first-page":"799","DOI":"10.3150\/07-BEJ5102","volume":"13","author":"A. Christmann","year":"2007","unstructured":"A. Christmann, I. Steinwart, Consistency and robustness of kernel-based regression in convex risk minimization, Bernoulli 13, 799\u2013819 (2007).","journal-title":"Bernoulli"},{"key":"9026_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-01-00923-5","volume":"39","author":"F. Cucker","year":"2001","unstructured":"F. Cucker, S. Smale, On the mathematical foundations of learning theory, Bull. Am. Math. Soc. 39, 1\u201349 (2001).","journal-title":"Bull. Am. Math. Soc."},{"key":"9026_CR7","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s102080010030","volume":"2","author":"F. Cucker","year":"2002","unstructured":"F. Cucker, S. Smale, Best choices for regularization parameters in learning theory: On the bias-variance problem, Found. Comput. Math. 2, 413\u2013428 (2002).","journal-title":"Found. Comput. Math."},{"key":"9026_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10208-004-0134-1","volume":"5","author":"E. Vito De","year":"2005","unstructured":"E. De Vito, A. Caponnetto, L. Rosasco, Model selection for regularized least-squares algorithm in learning theory, Found. Comput. Math. 5, 59\u201385 (2005).","journal-title":"Found. Comput. Math."},{"key":"9026_CR9","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1997","unstructured":"L. Devroye, L. Gy\u00f6rfi, G. Lugosi, A Probabilistic Theory of Pattern Recognition (Springer, New York, 1997)."},{"key":"9026_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018946025316","volume":"13","author":"T. Evgeniou","year":"2000","unstructured":"T. Evgeniou, M. Pontil, T. Poggio, Regularization networks and support vector machines, Adv. Comput. Math. 13, 1\u201350 (2000).","journal-title":"Adv. Comput. Math."},{"key":"9026_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/0471725250","volume-title":"Robust Statistics","author":"P.J. Huber","year":"1981","unstructured":"P.J. Huber, Robust Statistics (Wiley, New York, 1981)."},{"key":"9026_CR12","first-page":"537","volume":"50","author":"T. Poggio","year":"2003","unstructured":"T. Poggio, S. Smale, The mathematics of learning: Deal with data, Not. Am. Math. Soc. 50, 537\u2013544 (2003).","journal-title":"Not. Am. Math. Soc."},{"key":"9026_CR13","unstructured":"M. Pontil, S. Mukherjee, F. Girosi, On the noise model of support vector machine regression, A.I. Memo 1651, MIT Artificial Intelligence Lab., 1998."},{"key":"9026_CR14","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1162\/089976604773135104","volume":"16","author":"L. Rosasco","year":"2004","unstructured":"L. Rosasco, E. De Vito, A. Caponnetto, M. Piana, A. Verri, Are loss functions all the same? Neural Comput. 16, 1063\u20131076 (2004).","journal-title":"Neural Comput."},{"key":"9026_CR15","volume-title":"Learning with Kernel","author":"B. Scholkopf","year":"2002","unstructured":"B. Scholkopf, A.J. Smola, Learning with Kernel (MIT Press, Cambridge, 2002)."},{"key":"9026_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.acha.2005.03.001","volume":"19","author":"S. Smale","year":"2005","unstructured":"S. Smale, D.X. Zhou, Shannon sampling II. Connections to learning theory, Appl. Comput. Harmon. Anal. 19, 285\u2013302 (2005).","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"9026_CR17","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00365-006-0659-y","volume":"26","author":"S. Smale","year":"2007","unstructured":"S. Smale, D.X. Zhou, Learning theory estimates via integral operators and their applications, Constr. Approx. 26, 153\u2013172 (2007).","journal-title":"Constr. Approx."},{"key":"9026_CR18","doi-asserted-by":"crossref","unstructured":"C. Scovel, I. Steinwart, Fast rates for support vector machine, in Proceedings of the Conference on Learning Theory (COLT-2005), pp.\u00a0279\u2013294.","DOI":"10.1007\/11503415_19"},{"key":"9026_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The Nature of Statistical Learning Theory","author":"V. Vapnik","year":"1995","unstructured":"V. Vapnik, The Nature of Statistical Learning Theory (Springer, New York, 1995)."},{"key":"9026_CR20","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"V. Vapnik, Statistical Learning Theory (Wiley, New York, 1998)."},{"key":"9026_CR21","doi-asserted-by":"crossref","first-page":"1160","DOI":"10.1162\/0899766053491896","volume":"17","author":"Q. Wu","year":"2005","unstructured":"Q. Wu, D.X. Zhou, SVM soft margin classifiers: Linear programming versus quadratic programming, Neural Comput. 17, 1160\u20131187 (2005).","journal-title":"Neural Comput."},{"key":"9026_CR22","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10208-004-0155-9","volume":"6","author":"Q. Wu","year":"2006","unstructured":"Q. Wu, Y. Ying, D.X. Zhou, Learning rates of least-square regularized regression, Found. Comput. Math. 6, 171\u2013192 (2006).","journal-title":"Found. Comput. Math."},{"key":"9026_CR23","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1006\/jcom.2002.0635","volume":"18","author":"D.X. Zhou","year":"2002","unstructured":"D.X. Zhou, The covering number in learning theory, J. Complex. 18, 739\u2013767 (2002).","journal-title":"J. Complex."},{"key":"9026_CR24","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1109\/TIT.2003.813564","volume":"49","author":"D.X. Zhou","year":"2003","unstructured":"D.X. Zhou, Capacity of reproducing kernel spaces in learning theory, IEEE Trans. Inf. Theory 49, 1743\u20131752 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9026_CR25","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10444-004-7206-2","volume":"25","author":"D.X. Zhou","year":"2006","unstructured":"D.X. Zhou, K. Jetter, Approximation with polynomial kernels and SVM classifiers, Adv. Comput. Math. 25, 323\u2013344 (2006).","journal-title":"Adv. Comput. Math."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-008-9026-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-008-9026-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-008-9026-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:05:09Z","timestamp":1559127909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-008-9026-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,4]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9026"],"URL":"https:\/\/doi.org\/10.1007\/s10208-008-9026-0","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,4]]}}}