{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:08:50Z","timestamp":1740175730005,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T00:00:00Z","timestamp":1662336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T00:00:00Z","timestamp":1662336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["61876138","61203311"],"award-info":[{"award-number":["61876138","61203311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"natural science foundation of shaanxi province","doi-asserted-by":"publisher","award":["2019JM-365"],"award-info":[{"award-number":["2019JM-365"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010228","name":"natural science foundation of shaanxi provincial department of education","doi-asserted-by":"publisher","award":["17JK0701"],"award-info":[{"award-number":["17JK0701"]}],"id":[{"id":"10.13039\/501100010228","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A typical ensemble learning process typically uses a forward integration mechanism to construct the ensemble classifier with a large number of base classifiers. Based on this mechanism, it is difficult to adjust the diversity among base classifiers and optimize the structure inside ensemble since the generation process has a certain amount of randomness, which makes the performance of ensemble classifiers heavily dependent on the human design decisions. To address this issue, we proposed an automatic ensemble classifier construction method based on a dual-layer evolutionary search mechanism, which includes a tree coding-based base classifier population and a binary coding-based ensemble classifier population. Through a collaborative searching process between the two populations, the proposed method can be driven by training data to update the base classifier population and optimize the ensemble classifiers globally. To verify the effectiveness of the dual evolutionary ensemble learning method (DEEL), we tested it on 22 classification tasks from 4 data repositories. The results show that the proposed method can generate a diverse decision tree population on the training data while searching and constructing ensemble classifiers from them. Compared with 9 competitor algorithms, the proposed method achieved the best performance on 17 of 22 test tasks and improved the average accuracies by 0.97\u20137.65% over the second place. In particular, the generated ensemble classifiers show excellent structure, which involve small number and diverse decision trees. That increases the transparency of ensembles and helps to perform interpretability analysis on them.<\/jats:p>","DOI":"10.1007\/s40747-022-00855-x","type":"journal-article","created":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T09:07:59Z","timestamp":1662368879000},"page":"1327-1345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using dual evolutionary search to construct decision tree based ensemble classifier"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6418-3043","authenticated-orcid":false,"given":"Hao","family":"Chen","sequence":"first","affiliation":[]},{"given":"Guoxin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiaoying","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Jia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,5]]},"reference":[{"issue":"4","key":"855_CR1","first-page":"97","volume":"18","author":"TG Dietterich","year":"1997","unstructured":"Dietterich TG (1997) Machine-learning research. AI Mag 18(4):97\u201397","journal-title":"AI Mag"},{"issue":"2","key":"855_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L (1996) Bagging predictors. Mach Learn 24(2):123\u2013140","journal-title":"Mach Learn"},{"issue":"1","key":"855_CR3","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(1):119\u2013139","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"855_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","volume":"5","author":"DH Wolpert","year":"1992","unstructured":"Wolpert DH (1992) Stacked generalization. Neural Netw 5(2):241\u2013259","journal-title":"Neural Netw"},{"issue":"1","key":"855_CR5","first-page":"1","volume":"14","author":"MJ Zohaib","year":"2019","unstructured":"Zohaib MJ, Verma B (2019) Evolutionary classifier and cluster selection approach for ensemble classification. ACM Trans Knowl Discov Data 14(1):1\u201318","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"1\u20132","key":"855_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0004-3702(02)00190-X","volume":"137","author":"ZH Zhou","year":"2002","unstructured":"Zhou ZH, Wu J, Tang W (2002) Ensembling neural networks: many could be better than all. Artif Intell 137(1\u20132):239\u2013263","journal-title":"Artif Intell"},{"key":"855_CR7","volume-title":"Encyclopedia of machine learning","author":"C Sammut","year":"2011","unstructured":"Sammut C, Webb GI (2011) Encyclopedia of machine learning. Springer Science & Business Media, Berlin"},{"key":"855_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.asoc.2019.01.015","volume":"77","author":"Y Wang","year":"2019","unstructured":"Wang Y, Wang D, Geng N et al (2019) Stacking-based ensemble learning of decision trees for interpretable prostate cancer detection. Appl Soft Comput 77:188\u2013204","journal-title":"Appl Soft Comput"},{"key":"855_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105664","volume":"83","author":"V Ribeiro","year":"2019","unstructured":"Ribeiro V, Reynoso-Meza G (2019) A holistic multi-objective optimization design procedure for ensemble member generation and selection. Appl Soft Comput 83:105664","journal-title":"Appl Soft Comput"},{"key":"855_CR10","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.knosys.2018.10.009","volume":"163","author":"A Galicia","year":"2019","unstructured":"Galicia A, Talavera-Llames R, Troncoso A et al (2019) Multi-step forecasting for big data time series based on ensemble learning. Knowl Based Syst 163:830\u2013841","journal-title":"Knowl Based Syst"},{"issue":"1","key":"855_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"issue":"11","key":"855_CR12","first-page":"32","volume":"50","author":"QIAO Zhang Zhao-Zhao","year":"2018","unstructured":"Zhang Zhao-Zhao QIAO, Jun-Fei YUW (2018) Structure design of hierarchical adaptive modular neural network. Chin J Comput 50(11):32\u201339","journal-title":"Chin J Comput"},{"issue":"01","key":"855_CR13","first-page":"189","volume":"36","author":"Li Yi-Jing","year":"2016","unstructured":"Yi-Jing Li, Hai-Xiang G, Ya-Nan Li, Xiao L (2016) A boosting based ensemble learning algorithm in imbalanced data classification. Syst Eng Theory Pract 36(01):189\u2013199","journal-title":"Syst Eng Theory Pract"},{"issue":"12","key":"855_CR14","doi-asserted-by":"publisher","first-page":"5328","DOI":"10.1109\/TITS.2019.2948790","volume":"21","author":"Y Liu","year":"2019","unstructured":"Liu Y, Lyu C, Khadka A et al (2019) Spatio-temporal ensemble method for car-hailing demand prediction. IEEE Trans Intell Transp Syst 21(12):5328\u20135333","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"2","key":"855_CR15","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1109\/TGCN.2020.2987304","volume":"4","author":"L Wang","year":"2020","unstructured":"Wang L, Mao S, Wilamowski BM et al (2020) Ensemble learning for load forecasting. IEEE Trans Green Commun Netw 4(2):616\u2013628","journal-title":"IEEE Trans Green Commun Netw"},{"issue":"1","key":"855_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1093\/nsr\/nwy108","volume":"6","author":"ZH Zhou","year":"2019","unstructured":"Zhou ZH, Feng J (2019) Deep forest. Natl Sci Rev 6(1):74\u201386","journal-title":"Natl Sci Rev"},{"issue":"4","key":"855_CR17","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TEVC.2018.2879078","volume":"23","author":"W Wang","year":"2018","unstructured":"Wang W, Yang S, Lin Q et al (2018) An effective ensemble framework for multiobjective optimization. IEEE Trans Evol Comput 23(4):645\u2013659","journal-title":"IEEE Trans Evol Comput"},{"key":"855_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.neucom.2017.03.055","volume":"247","author":"W Sheng","year":"2017","unstructured":"Sheng W, Shan P, Chen S et al (2017) A niching evolutionary algorithm with adaptive negative correlation learning for neural network ensemble. Neurocomputing 247:173\u2013182","journal-title":"Neurocomputing"},{"key":"855_CR19","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.dss.2018.05.003","volume":"111","author":"J Zhao","year":"2018","unstructured":"Zhao J, Jiao L, Xia S et al (2018) Multiobjective sparse ensemble learning by means of evolutionary algorithms. Decis Support Syst 111:86\u2013100","journal-title":"Decis Support Syst"},{"issue":"5","key":"855_CR20","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1109\/TEVC.2017.2782826","volume":"22","author":"M Asafuddoula","year":"2017","unstructured":"Asafuddoula M, Verma B, Zhang M (2017) A divide-and-conquer-based ensemble classifier learning by means of many-objective optimization. IEEE Trans Evol Comput 22(5):762\u2013777","journal-title":"IEEE Trans Evol Comput"},{"key":"855_CR21","first-page":"1","volume":"99","author":"X Wang","year":"2021","unstructured":"Wang X, Hu T, Tang L (2021) A multiobjective evolutionary nonlinear ensemble learning with evolutionary feature selection for silicon prediction in blast furnace. IEEE Trans Neural Netw Learn Syst 99:1\u201314","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"855_CR22","doi-asserted-by":"crossref","unstructured":"Wen X, Wu G, Fan M, et al (2020) Voting-mechanism based ensemble constraint handling technique for real-world single-objective constrained optimization. 2020 IEEE Congress on Evolutionary Computation. IEEE, pp 1-8.","DOI":"10.1109\/CEC48606.2020.9185632"},{"issue":"2","key":"855_CR23","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10994-019-05855-6","volume":"109","author":"JE Van Engelen","year":"2020","unstructured":"Van Engelen JE, Hoos HH (2020) A survey on semi-supervised learning. Mach Learn 109(2):373\u2013440","journal-title":"Mach Learn"},{"issue":"6","key":"855_CR24","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.patrec.2013.01.003","volume":"34","author":"L Guo","year":"2013","unstructured":"Guo L, Boukir S (2013) Margin-based ordered aggregation for ensemble pruning. Pattern Recogn Lett 34(6):603\u2013609","journal-title":"Pattern Recogn Lett"},{"key":"855_CR25","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.asoc.2014.10.045","volume":"28","author":"Q Dai","year":"2015","unstructured":"Dai Q, Zhang T, Liu N (2015) A new reverse reduce-error ensemble pruning algorithm. Appl Soft Comput 28:237\u2013249","journal-title":"Appl Soft Comput"},{"key":"855_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9","volume-title":"Evolutionary learning: advances in theories and algorithms","author":"ZH Zhou","year":"2019","unstructured":"Zhou ZH, Yu Y, Qian C (2019) Evolutionary learning: advances in theories and algorithms. Springer, Singapore"},{"key":"855_CR27","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.patrec.2016.01.029","volume":"74","author":"GDC Cavalcanti","year":"2016","unstructured":"Cavalcanti GDC, Oliveira LS, Moura TJM et al (2016) Combining diversity measures for ensemble pruning. Pattern Recogn Lett 74:38\u201345","journal-title":"Pattern Recogn Lett"},{"issue":"7","key":"855_CR28","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1007\/s10489-017-1027-8","volume":"48","author":"X Zhu","year":"2018","unstructured":"Zhu X, Ni Z, Cheng M et al (2018) Selective ensemble based on extreme learning machine and improved discrete artificial fish swarm algorithm for haze forecast. Appl Intell 48(7):1757\u20131775","journal-title":"Appl Intell"},{"key":"855_CR29","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.inffus.2016.06.003","volume":"34","author":"H Ykhlef","year":"2017","unstructured":"Ykhlef H, Bouchaffra D (2017) An efficient ensemble pruning approach based on simple coalitional games. Inform Fus 34:28\u201342","journal-title":"Inform Fus"},{"key":"855_CR30","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-12127-2_14","volume-title":"Multi-information ensemble diversity International Workshop on Multiple Classifier Systems","author":"ZH Zhou","year":"2010","unstructured":"Zhou ZH, Li N (2010) Multi-information ensemble diversity International Workshop on Multiple Classifier Systems. Springer, Berlin, pp 134\u2013144"},{"issue":"5","key":"855_CR31","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1002\/widm.1158","volume":"5","author":"S Gu","year":"2015","unstructured":"Gu S, Cheng R, Jin Y (2015) Multi-objective ensemble generation. Wiley Interdiscip Rev Data Mining Knowl Discov 5(5):234\u2013245","journal-title":"Wiley Interdiscip Rev Data Mining Knowl Discov"},{"key":"855_CR32","doi-asserted-by":"publisher","first-page":"156360","DOI":"10.1109\/ACCESS.2019.2949059","volume":"7","author":"MZ Jan","year":"2019","unstructured":"Jan MZ, Verma B (2019) A novel diversity measure and classifier selection approach for generating ensemble classifiers. IEEE Access 7:156360\u2013156373","journal-title":"IEEE Access"},{"key":"855_CR33","doi-asserted-by":"crossref","unstructured":"Liu L, Wei W, Chow KH, et al (2019) Deep neural network ensembles against deception: ensemble diversity, accuracy and robustness. 2019 IEEE 16th International Conference on Mobile Ad Hoc and Sensor Systems, pp 274\u2013282","DOI":"10.1109\/MASS.2019.00040"},{"key":"855_CR34","first-page":"189","volume":"36","author":"Y-J Li","year":"2016","unstructured":"Li Y-J et al (2016) A boosting based ensemble learning algorithm in imbalanced data classification. Syst Eng Theory Pract 36:189\u2013199","journal-title":"Syst Eng Theory Pract"},{"issue":"01","key":"855_CR35","first-page":"1","volume":"42","author":"LIU Jiang Zheng-Shen","year":"2019","unstructured":"Jiang Zheng-Shen LIU, Hong-Zhi FUB, Zhong-Hai WU (2019) Decomposition theories of generalization error and auc in ensemble learning with application in weight optimization. Chin J Comput 42(01):1\u201315","journal-title":"Chin J Comput"},{"issue":"04","key":"855_CR36","first-page":"3146","volume":"34","author":"G Aglin","year":"2020","unstructured":"Aglin G, Nijssen S, Schaus P (2020) Learning optimal decision trees using caching branch-and-bound search. Proc AAAI Conf Artif Intell 34(04):3146\u201331531","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"855_CR37","first-page":"1","volume":"32","author":"X Hu","year":"2019","unstructured":"Hu X, Rudin C, Seltzer M (2019) Optimal sparse decision trees. Adv Neural Inf Process Syst 32:1\u201314","journal-title":"Adv Neural Inf Process Syst"},{"key":"855_CR38","first-page":"2079","volume":"11","author":"GC Cawley","year":"2010","unstructured":"Cawley GC, Talbot NLC (2010) On over-fitting in model selection and subsequent selection bias in performance evaluation. J Mach Learn Res 11:2079\u20132107","journal-title":"J Mach Learn Res"},{"key":"855_CR39","unstructured":"Raschka S (2018) Model evaluation, model selection, and algorithm selection in machine learning. arXiv preprint arXiv:1811.12808"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00855-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00855-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00855-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T09:22:53Z","timestamp":1681809773000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00855-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,5]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["855"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00855-x","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2022,9,5]]},"assertion":[{"value":"15 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}