{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T09:30:34Z","timestamp":1768642234862,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s42979-020-00358-x","type":"journal-article","created":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T13:02:42Z","timestamp":1603544562000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Selective Cascade of Residual ExtraTrees"],"prefix":"10.1007","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3840-1136","authenticated-orcid":false,"given":"Qimin","family":"Liu","sequence":"first","affiliation":[]},{"given":"Fang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,24]]},"reference":[{"key":"358_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"TG Dietterich","year":"2000","unstructured":"Dietterich TG. An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Mach Learn. 2000;40:139\u201357.","journal-title":"Mach Learn"},{"issue":"2","key":"358_CR2","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L. Bagging predictors. Mach Learn. 1996;24(2):123\u201340.","journal-title":"Mach Learn"},{"issue":"8","key":"358_CR3","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"TK Ho","year":"1998","unstructured":"Ho TK. The random subspace method for constructing decision forests. IEEE Trans Pattern Anal Mach Intell. 1998;20(8):832\u201344.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"358_CR4","unstructured":"Ho TK. Random decision forest. In: Proceedings of the 3rd international conference on document analysis and recognition; 1995. pp. 278\u2013282."},{"issue":"1","key":"358_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts P, Ernst D, Wehenkel L. Extremely randomized trees. Mach Learn. 2006;63(1):3\u201342.","journal-title":"Mach Learn"},{"key":"358_CR6","unstructured":"Fan W, Wang H, Yu P, Ma S. Is random model better? On its accuracy and efficiency. In: Third IEEE international conference on data mining, no. October 2015. IEEE Comput Soc; 2003. pp. 51\u201358."},{"key":"358_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1613\/jair.2470","volume":"32","author":"FT Liu","year":"2008","unstructured":"Liu FT, Ting KM, Yu Y, Zhou Z-H. Spectrum of variable-random trees. J Artif Intell Res. 2008;32:355\u201384.","journal-title":"J Artif Intell Res"},{"issue":"5","key":"358_CR8","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman JH. Greedy function approximation: a gradient boosting machine. Ann Stat. 2001;29(5):1189\u2013232.","journal-title":"Ann Stat"},{"key":"358_CR9","first-page":"512","volume":"2000","author":"L Mason","year":"2000","unstructured":"Mason L, Baxter J, Bartlett P, Frean M. Boosting algorithms as gradient descent. Adv Neural Inf Process Syst. 2000;2000:512\u20138.","journal-title":"Adv Neural Inf Process Syst"},{"issue":"7","key":"358_CR10","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1162\/neco.2006.18.7.1527","volume":"18","author":"GE Hinton","year":"2006","unstructured":"Hinton GE, Osindero S, Teh Y-W. A fast learning algorithm for deep belief nets. Neural Comput. 2006;18(7):1527\u201354.","journal-title":"Neural Comput"},{"key":"358_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-017-17765-5","volume":"8","author":"Y Kong","year":"2018","unstructured":"Kong Y, Yu T. A deep neural network model using random forest to extract feature representation for gene expression data classification. Sci Rep. 2018;8:1\u20139.","journal-title":"Sci Rep"},{"key":"358_CR12","doi-asserted-by":"crossref","unstructured":"Zhou ZH, Feng J. Deep forest: towards an alternative to deep neural networks. In: IJCAI international joint conference on artificial intelligence; 2017. pp. 3553\u20133559.","DOI":"10.24963\/ijcai.2017\/497"},{"key":"358_CR13","first-page":"3551","volume":"2018","author":"J Feng","year":"2018","unstructured":"Feng J, Yu Y, Zhou ZH. Multi-layered gradient boosting decision trees. Adv Neural Inf Process Syst. 2018;2018:3551\u201361.","journal-title":"Adv Neural Inf Process Syst"},{"issue":"8","key":"358_CR14","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1109\/TPAMI.2013.50","volume":"35","author":"Y Bengio","year":"2013","unstructured":"Bengio Y, Courville A, Vincent P. Representation learning: a review and new perspectives. IEEE Trans Pattern Anal Mach Intell. 2013;35(8):1798\u2013828.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"358_CR15","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. A decision-theoretic generalization of on-line learning and an application to boosting. J Comput Syst Sci. 1997;55(1):119\u201339.","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"358_CR16","first-page":"197","volume":"5","author":"RE Schapire","year":"1990","unstructured":"Schapire RE. The strength of weak learnability. Mach Learn. 1990;5(2):197\u2013227.","journal-title":"Mach Learn"},{"key":"358_CR17","doi-asserted-by":"crossref","unstructured":"Li N, Zhou ZH. Selective ensemble under regularization framework. In: Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics; 2009.","DOI":"10.1007\/978-3-642-02326-2_30"},{"key":"358_CR18","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1109\/TPAMI.2013.50","volume":"35","author":"Y Bengio","year":"2013","unstructured":"Bengio Y, Courville A, Vincent P. Representation learning: a review and new perspectives. IEEE Trans Pattern Anal Mach Intell. 2013;35:1798\u2013828.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"358_CR19","first-page":"1621","volume":"6","author":"G Brown","year":"2005","unstructured":"Brown G, Wyatt JL, Tino P. Managing diversity in regression ensembles. J Mach Learn Res. 2005;6:1621\u20132650.","journal-title":"J Mach Learn Res"},{"issue":"1","key":"358_CR20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R. Regression shrinkage and selection via the Lasso. J R Stat Soc Ser B (Methodol). 1996;58(1):267\u201388.","journal-title":"J R Stat Soc Ser B (Methodol)"},{"key":"358_CR21","unstructured":"Helliwell J, Layard R, Sachs J. World Happiness Report 2019. In: Sustainable development solutions network, New York, Tech. Rep., 2019. https:\/\/worldhappiness.report\/ed\/2019\/."},{"issue":"3\u20134","key":"358_CR22","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.ecolmodel.2004.03.013","volume":"178","author":"JD Olden","year":"2004","unstructured":"Olden JD, Joy MK, Death RG. An accurate comparison of methods for quantifying variable importance in artificial neural networks using simulated data. Ecol Model. 2004;178(3\u20134):389\u201397.","journal-title":"Ecol Model"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00358-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-020-00358-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00358-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T11:09:47Z","timestamp":1723806587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-020-00358-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,24]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["358"],"URL":"https:\/\/doi.org\/10.1007\/s42979-020-00358-x","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,24]]},"assertion":[{"value":"18 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"354"}}