{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T20:10:07Z","timestamp":1718482207530},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T00:00:00Z","timestamp":1460073600000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s11432-016-5536-6","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T10:31:05Z","timestamp":1460629865000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning capability of the truncated greedy algorithm","\u622a\u65ad\u8d2a\u5a6a\u7b97\u6cd5\u7684\u5b66\u4e60\u6027\u80fd"],"prefix":"10.1007","volume":"59","author":[{"given":"Lin","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaobo","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongben","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,8]]},"reference":[{"key":"5536_CR1","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1214\/009053607000000631","volume":"36","author":"A R Barron","year":"2008","unstructured":"Barron A R, Cohen A, Dahmen W, et al. Approximation and learning by greedy algorithms. Ann Stat, 2008; 36: 64\u201394","journal-title":"Ann Stat"},{"key":"5536_CR2","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.jspi.2012.08.002","volume":"143","author":"H Chen","year":"2013","unstructured":"Chen H, Li L, Pan Z. Learning rates of multi-kernel regression by orthogonal greedy algorithm. J Statist Plan & Infer, 2013; 143: 276\u2013282","journal-title":"J Statist Plan & Infer"},{"key":"5536_CR3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.knosys.2015.12.011","volume":"95","author":"J Fang","year":"2016","unstructured":"Fang J, Lin S B, Xu Z B. Learning and approximation capabilities of orthogonal super greedy algorithm. Know Based Syst, 2016; 95: 86\u201398","journal-title":"Know Based Syst"},{"key":"5536_CR4","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"J Friedman","year":"2001","unstructured":"Friedman J. Greedy function approximation: a gradient boosting machine. Ann Stat, 2001; 29: 1189\u20131232","journal-title":"Ann Stat"},{"key":"5536_CR5","doi-asserted-by":"crossref","first-page":"1598","DOI":"10.1109\/TNNLS.2013.2265397","volume":"24","author":"S B Lin","year":"2013","unstructured":"Lin S B, Rong Y H, Sun X P, et al. Learning capability of relaxed greedy algorithms. IEEE Trans Neural Netw Learn Syst, 2013; 24: 1598\u20131608","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"5536_CR6","first-page":"713","volume":"4","author":"S Mannor","year":"2003","unstructured":"Mannor S, Meir R, Zhang T. Greedy algorithms for classification-consistency, convergence rates, and adaptivity. J Mach Learn Res, 2003; 4: 713\u2013742","journal-title":"J Mach Learn Res"},{"key":"5536_CR7","volume-title":"ArXiv:1411.3553","author":"L Xu","year":"2014","unstructured":"Xu L, Lin S B, Zeng J S, et al. Greedy metrics in orthogonal greedy learning. ArXiv:1411.3553, 2014"},{"key":"5536_CR8","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01449770","volume":"63","author":"E Schmidt","year":"1906","unstructured":"Schmidt E. Zur Theorie der linearen und nichtlinearen integralgleichungen I. Math Annalen, 1906; 63: 433\u2013476","journal-title":"Math Annalen"},{"key":"5536_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1017\/S0962492906380014","volume":"17","author":"V Temlyakov","year":"2008","unstructured":"Temlyakov V. Greedy approximation. Acta Numer, 2008; 17: 235\u2013409","journal-title":"Acta Numer"},{"key":"5536_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF02124742","volume":"5","author":"R A DeVore","year":"1996","unstructured":"DeVore R A, Temlyakov V. Some remarks on greedy algorithms. Adv Comput Math, 1996; 5: 173\u2013187","journal-title":"Adv Comput Math"},{"key":"5536_CR11","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s00365-003-0533-6","volume":"19","author":"E Livshitz","year":"2003","unstructured":"Livshitz E, Temlyakov V. Two lower estimates in greedy approximation. Constr Approx, 2003; 19: 509\u2013523","journal-title":"Constr Approx"},{"key":"5536_CR12","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1070\/IM2009v073n06ABEH002478","volume":"73","author":"E Livshits","year":"2009","unstructured":"Livshits E. Lower bounds for the rate of convergence of greedy algorithms. Izvestiya: Mathematics, 2009; 73: 1197\u20131215","journal-title":"Izvestiya: Mathematics"},{"key":"5536_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00365-006-0652-5","volume":"28","author":"V Temlyakov","year":"2008","unstructured":"Temlyakov V. Relaxation in greedy approximation. Constr Approx, 2008; 28: 1\u201325","journal-title":"Constr Approx"},{"key":"5536_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511618796","volume-title":"Learning Theory: an Approximation Theory Viewpoint.","author":"F Cucker","year":"2007","unstructured":"Cucker F, Zhou D X. Learning Theory: an Approximation Theory Viewpoint. Cambridge: Cambridge University Press, 2007"},{"key":"5536_CR15","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1214\/009053605000000255","volume":"33","author":"T Zhang","year":"2005","unstructured":"Zhang T, Yu B. Boosting with early stopping: convergence and consistency. Ann Statis, 2005; 33: 1538\u20131579","journal-title":"Ann Statis"},{"key":"5536_CR16","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1109\/TIT.2009.2039161","volume":"56","author":"A Bagirov","year":"2010","unstructured":"Bagirov A, Clausen C, Kohler M. An L2 boosting algorithm for estimation of a regression function. IEEE Trans Inf Theory, 2010; 56: 1417\u20131429","journal-title":"IEEE Trans Inf Theory"},{"key":"5536_CR17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"1","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R. Regression shrinkage and selection via the lasso. J R Stat Soc, 1996; 1: 267\u2013288","journal-title":"J R Stat Soc"},{"key":"5536_CR18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1080\/00401706.1979.10489751","volume":"21","author":"G H Golub","year":"1979","unstructured":"Golub G H, Heath M T, Wahba G. Generalized cross-validation as a method for choosing a good ridge parameter. Technometrics, 1979; 21: 215\u2013223","journal-title":"Technometrics"},{"key":"5536_CR19","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron B, Hastie T, Johnstone I, et al. Least angle regression. Ann Stat, 2004; 32: 407\u2013499","journal-title":"Ann Stat"},{"key":"5536_CR20","volume-title":"Scattered Data Approximation","author":"H Wendland","year":"2005","unstructured":"Wendland H. Scattered Data Approximation. Cambridge: Cambridge University Press, 2005"},{"key":"5536_CR21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10444-004-7206-2","volume":"25","author":"D X Zhou","year":"2006","unstructured":"Zhou D X, Jetter K. Approximation with polynomial kernels and SVM classifiers. Adv Comput Math, 2006; 25: 323\u2013344","journal-title":"Adv Comput Math"},{"key":"5536_CR22","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman L, Friedman J, Stone C, et al. Classification and Regression Trees. Boca Raton: CRC Press, 1984"},{"key":"5536_CR23","first-page":"55","volume-title":"UCI Repository of machine learning databases.","author":"C L Blake","year":"1998","unstructured":"Blake C L, Merz C J. UCI Repository of machine learning databases. Irvine: University of California. http:\/\/www. ics.uci.edu\/~mlearn\/MLRepository.html. 1998. 55"},{"key":"5536_CR24","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0095-0696(78)90006-2","volume":"5","author":"D Harrison","year":"1978","unstructured":"Harrison D, Rubinfeld D L. Hedonic prices and the demand for clean air. J Environ Econ, 1978; 5: 81\u2013102","journal-title":"J Environ Econ"},{"key":"5536_CR25","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1016\/S0008-8846(98)00165-3","volume":"28","author":"I C Ye","year":"1998","unstructured":"Ye I C. Modeling of strength of high performance concrete using artificial neural networks. Cement Concrete Res, 1998; 28: 1797\u20131808","journal-title":"Cement Concrete Res"},{"key":"5536_CR26","volume-title":"Technical Report","author":"W J Nash","year":"1994","unstructured":"Nash W J, Sellers T L, Talbot S R, et al. The Population Biology of Abalone (Haliotis Species) in Tasmania: Blacklip Abalone (H. Rubra) From the North Coast and Islands of Bass Strait. Technical Report. 1994"},{"key":"5536_CR27","volume-title":"Applied Mathematics","author":"E Kreyszig","year":"1979","unstructured":"Kreyszig E. Applied Mathematics. Hoboken: Wiley Press, 1979"},{"key":"5536_CR28","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.acha.2011.01.001","volume":"31","author":"L Shi","year":"2011","unstructured":"Shi L, Feng Y, Zhou D X. Concentration estimates for learning with l1-regularizer and data dependent hypothesis spaces. Appl Comput Harmon Anal, 2011; 31: 286\u2013302","journal-title":"Appl Comput Harmon Anal"},{"key":"5536_CR29","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.jco.2006.06.007","volume":"23","author":"Q Wu","year":"2007","unstructured":"Wu Q, Ying Y, Zhou D X. Multi-kernel regularized classifiers. J Complex, 2007; 23: 108\u2013134","journal-title":"J Complex"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-5536-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-016-5536-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-5536-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T19:11:47Z","timestamp":1718478707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-016-5536-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,8]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["5536"],"URL":"https:\/\/doi.org\/10.1007\/s11432-016-5536-6","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,8]]},"article-number":"052103"}}