{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:20:02Z","timestamp":1774722002250,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T00:00:00Z","timestamp":1550016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41401466"],"award-info":[{"award-number":["41401466"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s11063-019-09999-3","type":"journal-article","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T01:23:31Z","timestamp":1550021011000},"page":"957-987","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":98,"title":["On Incremental Learning for Gradient Boosting Decision Trees"],"prefix":"10.1007","volume":"50","author":[{"given":"Chongsheng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xianjin","family":"Shi","sequence":"additional","affiliation":[]},{"given":"George","family":"Almpanidis","sequence":"additional","affiliation":[]},{"given":"Gaojuan","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Xiajiong","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,13]]},"reference":[{"key":"9999_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-47534-9","volume-title":"Data streams: models and algorithms","author":"CC Aggarwal","year":"2007","unstructured":"Aggarwal CC (2007) Data streams: models and algorithms, vol 31. Springer, Berlin"},{"key":"9999_CR2","doi-asserted-by":"crossref","unstructured":"Babenko B, Yang MH, Belongie S (2009) A family of online boosting algorithms. In: IEEE 12th international conference on computer vision workshops (ICCV workshops). IEEE, pp 1346\u20131353","DOI":"10.1109\/ICCVW.2009.5457453"},{"key":"9999_CR3","unstructured":"Beygelzimer A, Hazan E, Kale S, Luo H (2015a) Online gradient boosting. In: NIPS, pp 2458\u20132466"},{"key":"9999_CR4","unstructured":"Beygelzimer A, Kale S, Luo H (2015b) Optimal and adaptive algorithms for online boosting. In: ICML"},{"key":"9999_CR5","unstructured":"Chapelle O, Chang Y (2011) Yahoo! learning to rank challenge overview. In: JMLR proceedings, pp 1\u201324"},{"key":"9999_CR6","unstructured":"Chen ST, Lin HT, Lu CJ (2012) An online boosting algorithm with theoretical justifications. In: ICML"},{"key":"9999_CR7","unstructured":"Dheeru D, Karra Taniskidou E (2017) UCI machine learning repository. \n                    http:\/\/archive.ics.uci.edu\/ml\n                    \n                  . Accessed 31 Jan 2019"},{"key":"9999_CR8","doi-asserted-by":"crossref","unstructured":"Domingos P, Hulten G (2000) Mining high-speed data streams. In: ACM SIGKDD. ACM, pp 71\u201380","DOI":"10.1145\/347090.347107"},{"issue":"2","key":"9999_CR9","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y Freund","year":"1995","unstructured":"Freund Y (1995) Boosting a weak learning algorithm by majority. Inf Comput 121(2):256\u2013285","journal-title":"Inf Comput"},{"key":"9999_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y, Schapire RE (1997) A decision-theoretic generalization of on-line learning and an application to boosting. J Comput Syst Sci 55:119\u2013139","journal-title":"J Comput Syst Sci"},{"key":"9999_CR11","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Ann Stat 29:1189\u20131232","journal-title":"Ann Stat"},{"issue":"2","key":"9999_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/1083784.1083789","volume":"34","author":"MM Gaber","year":"2005","unstructured":"Gaber MM, Zaslavsky A, Krishnaswamy S (2005) Mining data streams: a review. ACM Sigmod Rec 34(2):18\u201326","journal-title":"ACM Sigmod Rec"},{"key":"9999_CR13","doi-asserted-by":"crossref","unstructured":"Grbovic M, Vucetic S (2011) Tracking concept change with incremental boosting by minimization of the evolving exponential loss. In: PKDD. Springer, Berlin, pp 516\u2013532","DOI":"10.1007\/978-3-642-23780-5_43"},{"key":"9999_CR14","doi-asserted-by":"crossref","unstructured":"Hulten G, Spencer L, Domingos PM (2001) Mining time-changing data streams. In: ACM SIGKDD, pp 97\u2013106","DOI":"10.1145\/502512.502529"},{"key":"9999_CR15","doi-asserted-by":"crossref","unstructured":"Leistner C, Saffari A, Roth PM, Bischof H (2009) On robustness of on-line boosting: a competitive study. In: IEEE 12th international conference on computer vision workshops (ICCV workshops), pp 1362\u20131369","DOI":"10.1109\/ICCVW.2009.5457451"},{"key":"9999_CR16","doi-asserted-by":"crossref","unstructured":"Liu X, Yu T (2007) Gradient feature selection for online boosting. In: 2007 IEEE 11th international conference on computer vision (ICCV). IEEE, pp 1\u20138","DOI":"10.1109\/ICCV.2007.4408912"},{"key":"9999_CR17","unstructured":"Oza NC, Russell S (2001) Experimental comparisons of online and batch versions of bagging and boosting. In: ACM SIGKDD. ACM, pp 359\u2013364"},{"key":"9999_CR18","unstructured":"Oza NC, Russell SJ (2001) Online bagging and boosting. In: Eighth international workshop on artificial intelligence and statistics, pp 105\u2013112"},{"key":"9999_CR19","doi-asserted-by":"crossref","unstructured":"Pavlov DY, Gorodilov A, Brunk CA (2010) Bagboo: a scalable hybrid bagging-the-boosting model. In: Proceedings of the 19th ACM conference on information and knowledge management, CIKM 2010, Toronto, Ontario, Canada, October 26\u201330, 2010, pp 1897\u20131900","DOI":"10.1145\/1871437.1871758"},{"key":"9999_CR20","doi-asserted-by":"crossref","unstructured":"Pelossof R, Jones M, Vovsha I, Rudin C (2009) Online coordinate boosting. In: IEEE 12th international conference on computer vision workshops (ICCV workshops). IEEE, pp 1354\u20131361","DOI":"10.1109\/ICCVW.2009.5457454"},{"issue":"Mar","key":"9999_CR21","first-page":"1333","volume":"3","author":"S Perkins","year":"2003","unstructured":"Perkins S, Lacker K, Theiler J (2003) Grafting: fast, incremental feature selection by gradient descent in function space. J Mach Learn Res 3(Mar):1333\u20131356","journal-title":"J Mach Learn Res"},{"key":"9999_CR22","doi-asserted-by":"crossref","unstructured":"Zhang C, Hao Y, Mazuran M, Zaniolo C, Mousavi H, Masseglia F (2013) Mining frequent itemsets over tuple-evolving data streams. In: Proceedings of the 28th annual ACM symposium on applied computing, SAC\u201913, Coimbra, Portugal, March 18\u201322, 2013, pp 267\u2013274","DOI":"10.1145\/2480362.2480419"},{"key":"9999_CR23","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.eswa.2017.04.003","volume":"82","author":"C Zhang","year":"2017","unstructured":"Zhang C, Liu C, Zhang X, Almpanidis G (2017) An up-to-date comparison of state-of-the-art classification algorithms. Expert Syst Appl 82:128\u2013150. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2017.04.003","journal-title":"Expert Syst Appl"},{"key":"9999_CR24","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1214\/009053605000000255","volume":"33","author":"T Zhang","year":"2005","unstructured":"Zhang T, Yu B (2005) Boosting with early stopping: convergence and consistency. Ann Stat 33:1538\u20131579","journal-title":"Ann Stat"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11063-019-09999-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-019-09999-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-019-09999-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T19:08:25Z","timestamp":1581534505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11063-019-09999-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,13]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["9999"],"URL":"https:\/\/doi.org\/10.1007\/s11063-019-09999-3","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"value":"1370-4621","type":"print"},{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,13]]},"assertion":[{"value":"13 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}