{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T18:04:31Z","timestamp":1787162671526,"version":"build-2736575974"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["SFB 876 (DFG project number 124020371)"],"award-info":[{"award-number":["SFB 876 (DFG project number 124020371)"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01\u2014S18038A"],"award-info":[{"award-number":["01\u2014S18038A"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100016378","name":"Technische Universit\u00e4t Dortmund","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100016378","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Both the complex and evolving nature of time series data make forecasting among one of the most challenging tasks in machine learning. Typical methods for forecasting are designed to model time-evolving dependencies between data observations. However, it is generally accepted that none of them are universally valid for every application. Therefore, methods for learning heterogeneous ensembles by combining a diverse set of forecasters together appears as a promising solution to tackle this task. While several approaches in the context of time series forecasting have focused on how to combine individual models in an ensemble, ranging from simple and enhanced averaging tactics to applying meta-learning methods, few works have tackled the task of ensemble pruning, i.e. individual model selection to take part in the ensemble. In addition, in classical ML literature, ensemble pruning techniques are mostly restricted to operate in a static manner. To deal with changes in the relative performance of models as well as changes in the data distribution, we employ gradient-based saliency maps for online ensemble pruning of deep neural networks. This method consists of generating individual models\u2019 performance saliency maps that are subsequently used to prune the ensemble by taking into account both aspects of accuracy and diversity. In addition, the saliency maps can be exploited to provide suitable explanations for the reason behind selecting specific models to construct an ensemble that plays the role of a forecaster at a certain time interval or instant. An extensive empirical study on many real-world datasets demonstrates that our method achieves excellent or on par results in comparison to the state-of-the-art approaches as well as several baselines. Our code is available on Github (\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/MatthiasJakobs\/os-pgsm\/tree\/ecml_journal_2022\">https:\/\/github.com\/MatthiasJakobs\/os-pgsm\/tree\/ecml_journal_2022<\/jats:ext-link>\n                    ).\n                  <\/jats:p>","DOI":"10.1007\/s10994-022-06218-4","type":"journal-article","created":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T16:02:25Z","timestamp":1659456145000},"page":"3459-3487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Explainable online ensemble of deep neural network pruning for time series forecasting"],"prefix":"10.1007","volume":"111","author":[{"given":"Amal","family":"Saadallah","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4607-8957","authenticated-orcid":false,"given":"Matthias","family":"Jakobs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katharina","family":"Morik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,2]]},"reference":[{"key":"6218_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s10618-016-0483-9","volume":"31","author":"A Bagnall","year":"2017","unstructured":"Bagnall, A., Lines, J., Bostrom, A., Large, J., & Keogh, E. (2017). The great time series classification bake off: A review and experimental evaluation of recent algorithmic advances. Data Mining and Knowledge Discovery, 31, 606\u2013660.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"6218_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.inffus.2004.04.005","volume":"6","author":"RE Banfield","year":"2005","unstructured":"Banfield, R. E., Hall, L. O., Bowyer, K. W., & Kegelmeyer, W. P. (2005). Ensemble diversity measures and their application to thinning. Information Fusion, 6(1), 49\u201362.","journal-title":"Information Fusion"},{"key":"6218_CR3","volume-title":"Time series analysis: forecasting and control","author":"GE Box","year":"2015","unstructured":"Box, G. E., Jenkins, G. M., Reinsel, G. C., & Ljung, G. M. (2015). Time series analysis: forecasting and control. Wiley."},{"issue":"2","key":"6218_CR4","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L. (1996). Bagging predictors. Machine learning, 24(2), 123\u2013140.","journal-title":"Machine learning"},{"issue":"2","key":"6218_CR5","first-page":"1621","volume":"6","author":"G Brown","year":"2005","unstructured":"Brown, G., Wyatt, J. L., & Ti\u0148o, P. (2005). Managing diversity in regression ensembles. Journal of Machine Learning Research, 6(2), 1621\u20131650.","journal-title":"Journal of Machine Learning Research"},{"key":"6218_CR6","unstructured":"Burkardt, J. (2009). K-means clustering. In Advanced research computing, interdisciplinary center for applied mathematics. Virginia Tech."},{"key":"6218_CR7","unstructured":"Camburu, O.-M. (2020). Explaining deep neural networks. arXiv preprint arXiv:2010.01496."},{"key":"6218_CR8","doi-asserted-by":"crossref","unstructured":"Caruana, R., Niculescu-Mizil, A., Crew, G., & Ksikes, A. (2004). Ensemble selection from libraries of models. In Proceedings of the twenty-first international conference on machine learning, p. 18","DOI":"10.1145\/1015330.1015432"},{"key":"6218_CR9","doi-asserted-by":"crossref","unstructured":"Cerqueira, V., Torgo, L., Pinto, F., & Soares, C. (2017). Arbitrated ensemble for time series forecasting. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 478\u2013494. Springer","DOI":"10.1007\/978-3-319-71246-8_29"},{"key":"6218_CR10","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/s10994-018-05774-y","volume":"108","author":"V Cerqueira","year":"2018","unstructured":"Cerqueira, V., Torgo, L., Pinto, F., & Soares, C. (2018). Arbitrage of forecasting experts. Machine Learning, 108, 913.","journal-title":"Machine Learning"},{"key":"6218_CR11","doi-asserted-by":"crossref","unstructured":"Cheng, X., Rao, Z., Chen, Y., & Zhang, Q. (2020). Explaining knowledge distillation by quantifying the knowledge. In Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp. 12925\u201312935.","DOI":"10.1109\/CVPR42600.2020.01294"},{"issue":"7","key":"6218_CR12","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1109\/TKDE.2009.62","volume":"21","author":"H Chen","year":"2009","unstructured":"Chen, H., Ti\u0148o, P., & Yao, X. (2009). Predictive ensemble pruning by expectation propagation. IEEE Transactions on Knowledge and Data Engineering, 21(7), 999\u20131013.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6218_CR13","unstructured":"Dua, D., & Graff, C. (2017). UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"6218_CR14","unstructured":"Frosst, N., & Hinton, G. (2017). Distilling a neural network into a soft decision tree. arXiv preprint arXiv:1711.09784"},{"key":"6218_CR15","unstructured":"Gaillard, P., & Goude, Y. (2016). Opera: Online prediction by expert aggregation. R package version 1.0. https:\/\/CRAN.R-project.org\/package=opera"},{"issue":"4","key":"6218_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2523813","volume":"46","author":"J Gama","year":"2014","unstructured":"Gama, J., \u017dliobait\u0117, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014). A survey on concept drift adaptation. ACM Computing Surveys (CSUR), 46(4), 1\u201337.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"6218_CR17","unstructured":"Gamboa, J.C.B. (2017). Deep learning for time-series analysis. arXiv preprint arXiv:1701.01887"},{"key":"6218_CR18","doi-asserted-by":"crossref","unstructured":"Gers, F.A., Eck, D., & Schmidhuber, J. (2002). Applying lstm to time series predictable through time-window approaches. In: Neural Nets WIRN Vietri-01, pp. 193\u2013200. Springer.","DOI":"10.1007\/978-1-4471-0219-9_20"},{"key":"6218_CR19","doi-asserted-by":"crossref","unstructured":"Giacinto, G., Roli, F., & Fumera, G. (2000). Design of effective multiple classifier systems by clustering of classifiers. In Proceedings 15th international conference on pattern recognition. ICPR-2000, vol. 2, pp. 160\u2013163. IEEE.","DOI":"10.1109\/ICPR.2000.906039"},{"key":"6218_CR20","unstructured":"Godahewa, R., Bergmeir, C., Webb, G.I., Hyndman, R.J., & Montero-Manso, P. (2021). Monash time series forecasting archive. In Neural information processing systems track on datasets and benchmarks. forthcoming"},{"key":"6218_CR21","doi-asserted-by":"crossref","unstructured":"Hoeffding, W. (1994). Probability inequalities for sums of bounded random variables. In: The Collected Works of Wassily Hoeffding, pp. 409\u2013426. Springer.","DOI":"10.1007\/978-1-4612-0865-5_26"},{"key":"6218_CR22","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.eswa.2019.03.029","volume":"129","author":"E Hoseinzade","year":"2019","unstructured":"Hoseinzade, E., & Haratizadeh, S. (2019). Cnnpred: Cnn-based stock market prediction using a diverse set of variables. Expert Systems with Applications, 129, 273\u2013285. https:\/\/doi.org\/10.1016\/j.eswa.2019.03.029.","journal-title":"Expert Systems with Applications"},{"key":"6218_CR23","doi-asserted-by":"crossref","unstructured":"Jain, G., & Mallick, B. (2017). A study of time series models arima and ets. Available at SSRN 2898968.","DOI":"10.2139\/ssrn.2898968"},{"key":"6218_CR24","unstructured":"Kim, B., Wattenberg, M., Gilmer, J., Cai, C., Wexler, J., & Viegas, F., et al. (2018). Interpretability beyond feature attribution: Quantitative testing with concept activation vectors (tcav). In International Conference on Machine Learning, pp. 2668\u20132677. PMLR"},{"key":"6218_CR25","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.inffus.2017.02.004","volume":"37","author":"B Krawczyk","year":"2017","unstructured":"Krawczyk, B., Minku, L. L., Gama, J., Stefanowski, J., & Wo\u017aniak, M. (2017). Ensemble learning for data stream analysis: A survey. Information Fusion, 37, 132\u2013156.","journal-title":"Information Fusion"},{"key":"6218_CR26","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.procs.2015.11.026","volume":"66","author":"AV Krikunov","year":"2015","unstructured":"Krikunov, A. V., & Kovalchuk, S. V. (2015). Dynamic selection of ensemble members in multi-model hydrometeorological ensemble forecasting. Procedia Computer Science, 66, 220\u2013227.","journal-title":"Procedia Computer Science"},{"key":"6218_CR27","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, F., Schichtel, P., Ahmed, S., & Dengel, A. (2020). Conceptual explanations of neural network prediction for time series. In 2020 International joint conference on neural networks (IJCNN), pp. 1\u20136. IEEE.","DOI":"10.1109\/IJCNN48605.2020.9207341"},{"key":"6218_CR28","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.artmed.2019.01.001","volume":"94","author":"J-B Lamy","year":"2019","unstructured":"Lamy, J.-B., Sekar, B., Guezennec, G., Bouaud, J., & S\u00e9roussi, B. (2019). Explainable artificial intelligence for breast cancer: A visual case-based reasoning approach. Artificial Intelligence in Medicine, 94, 42\u201353.","journal-title":"Artificial Intelligence in Medicine"},{"key":"6218_CR29","doi-asserted-by":"crossref","unstructured":"Lazarevic, A., & Obradovic, Z. (2001). Effective pruning of neural network classifier ensembles. In: IJCNN\u201901. international joint conference on neural networks. Proceedings (Cat. No. 01CH37222), vol. 2, pp. 796\u2013801. IEEE.","DOI":"10.1109\/IJCNN.2001.939461"},{"key":"6218_CR30","doi-asserted-by":"publisher","first-page":"17351","DOI":"10.1007\/s00521-020-04867-x","volume":"32","author":"IE Livieris","year":"2020","unstructured":"Livieris, I. E., Pintelas, E., & Pintelas, P. (2020). A cnn-lstm model for gold price time-series forecasting. Neural Computing and Applications, 32, 17351.","journal-title":"Neural Computing and Applications"},{"key":"6218_CR31","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-642-33460-3_27","volume-title":"Machine learning and knowledge discovery in databases","author":"N Li","year":"2012","unstructured":"Li, N., Yu, Y., & Zhou, Z.-H. (2012). Diversity regularized ensemble pruning. In P. A. Flach, T. De Bie, & N. Cristianini (Eds.), Machine learning and knowledge discovery in databases (pp. 330\u2013345). Springer."},{"issue":"1","key":"6218_CR32","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.eswa.2014.07.049","volume":"42","author":"Z Ma","year":"2015","unstructured":"Ma, Z., Dai, Q., & Liu, N. (2015). Several novel evaluation measures for rank-based ensemble pruning with applications to time series prediction. Expert Systems with Applications, 42(1), 280\u2013292.","journal-title":"Expert Systems with Applications"},{"key":"6218_CR33","unstructured":"Margineantu, D.D., & Dietterich, T.G. (1997). Pruning adaptive boosting. In: ICML, vol. 97, pp. 211\u2013218. Citeseer"},{"key":"6218_CR34","unstructured":"Mart\u0131nez-Munoz, G., & Su\u00e1rez, A. (2004). Aggregation ordering in bagging. In: Proc. of the IASTED International Conference on Artificial Intelligence and Applications, pp. 258\u2013263. Citeseer"},{"issue":"2","key":"6218_CR35","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TPAMI.2008.78","volume":"31","author":"G Martinez-Munoz","year":"2008","unstructured":"Martinez-Munoz, G., Hern\u00e1ndez-Lobato, D., & Su\u00e1rez, A. (2008). An analysis of ensemble pruning techniques based on ordered aggregation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2), 245\u2013259.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6218_CR36","unstructured":"Molnar, C. (2020). Interpretable Machine Learning. Lulu.com."},{"key":"6218_CR37","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.neucom.2013.10.030","volume":"131","author":"A Mozaffari","year":"2014","unstructured":"Mozaffari, A., & Azad, N. L. (2014). Optimally pruned extreme learning machine with ensemble of regularization techniques and negative correlation penalty applied to automotive engine coldstart hydrocarbon emission identification. Neurocomputing, 131, 143\u2013156.","journal-title":"Neurocomputing"},{"issue":"11","key":"6218_CR38","doi-asserted-by":"publisher","first-page":"7","DOI":"10.23915\/distill.00007","volume":"2","author":"C Olah","year":"2017","unstructured":"Olah, C., Mordvintsev, A., & Schubert, L. (2017). Feature visualization. Distill, 2(11), 7.","journal-title":"Distill"},{"key":"6218_CR39","doi-asserted-by":"crossref","unstructured":"Partalas, I., Tsoumakas, G., Katakis, I., & Vlahavas, I. (2006). Ensemble pruning using reinforcement learning. In hellenic conference on artificial intelligence, pp. 301\u2013310. Springer","DOI":"10.1007\/11752912_31"},{"key":"6218_CR40","volume-title":"A study on greedy algorithms for ensemble pruning","author":"I Partalas","year":"2012","unstructured":"Partalas, I., Tsoumakas, G., & Vlahavas, I. (2012). A study on greedy algorithms for ensemble pruning. Thessaloniki, Greece: Aristotle University of Thessaloniki."},{"key":"6218_CR41","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., & Guestrin, C. (2016). \" why should i trust you?\" explaining the predictions of any classifier. In Proceedings of the 22nd ACM sigkdd international conference on knowledge discovery and data mining. pp. 1135\u20131144.","DOI":"10.1145\/2939672.2939778"},{"key":"6218_CR42","doi-asserted-by":"crossref","unstructured":"Romeu, P., Zamora-Mart\u00ednez, F., Botella-Rocamora, P., & Pardo, J. (2013). Time-series forecasting of indoor temperature using pre-trained deep neural networks. In International Conference on Artificial Neural Networks, pp. 451\u2013458. Springer","DOI":"10.1007\/978-3-642-40728-4_57"},{"key":"6218_CR43","doi-asserted-by":"crossref","unstructured":"Saadallah, A., & Morik, K. (2021). Online ensemble aggregation using deep reinforcement learning for time series forecasting. In 2021 IEEE 8th International Conference on Data Science and Advanced Analytics (DSAA). IEEE","DOI":"10.1109\/DSAA53316.2021.9564132"},{"key":"6218_CR44","doi-asserted-by":"crossref","unstructured":"Saadallah, A., Jakobs, M., & Morik, K. (2021). Explainable online deep neural network selection using adaptive saliency maps for time series forecasting. In: Oliver, N., P\u00e9rez-Cruz, F., Kramer, S., Read, J., Lozano, J.A. (eds.) Machine Learning and Knowledge Discovery in Databases. Research Track, pp. 404\u2013420. Springer, Cham.","DOI":"10.1007\/978-3-030-86486-6_25"},{"key":"6218_CR45","doi-asserted-by":"crossref","unstructured":"Saadallah, A., Priebe, F., & Morik, K. (2019). A drift-based dynamic ensemble members selection using clustering for time series forecasting. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer","DOI":"10.1007\/978-3-030-46150-8_40"},{"key":"6218_CR46","doi-asserted-by":"crossref","unstructured":"Saadallah, A., Tavakol, M., & Morik, K. (2021). An actor-critic ensemble aggregation model for time-series forecasting. In IEEE International Conference on Data Engineering (ICDE)","DOI":"10.1109\/ICDE51399.2021.00233"},{"key":"6218_CR47","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1109\/TKDE.2018.2883616","volume":"32","author":"A Saadallah","year":"2018","unstructured":"Saadallah, A., Moreira-Matias, L., Sousa, R., Khiari, J., Jenelius, E., & Gama, J. (2018). Bright-drift-aware demand predictions for taxi networks. IEEE Transactions on Knowledge and Data Engineering, 32, 234.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"6218_CR48","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/JPROC.2021.3060483","volume":"109","author":"W Samek","year":"2021","unstructured":"Samek, W., Montavon, G., Lapuschkin, S., Anders, C. J., & M\u00fcller, K.-R. (2021). Explaining deep neural networks and beyond: A review of methods and applications. Proceedings of the IEEE, 109(3), 247\u2013278.","journal-title":"Proceedings of the IEEE"},{"key":"6218_CR49","doi-asserted-by":"crossref","unstructured":"Selvaraju, R.R., Cogswell, M., Das, A., Vedantam, R., Parikh, D., & Batra, D. (2017). Grad-cam: Visual explanations from deep networks via gradient-based localization. In Proceedings of the IEEE international conference on computer vision, pp. 618\u2013626.","DOI":"10.1109\/ICCV.2017.74"},{"key":"6218_CR50","unstructured":"Simonyan, K., Vedaldi, A., & Zisserman, A. (2013). Deep inside convolutional networks: Visualising image classification models and saliency maps. arXiv preprint arXiv:1312.6034."},{"key":"6218_CR51","doi-asserted-by":"crossref","unstructured":"Stolpe, M., Bhaduri, K., & Das, K. (2016). Distributed support vector machines: An overview. Solving large scale learning tasks. Challenges and Algorithms, 109\u2013138.","DOI":"10.1007\/978-3-319-41706-6_5"},{"key":"6218_CR52","doi-asserted-by":"crossref","unstructured":"Street, W.N., & Kim, Y. (2001). A streaming ensemble algorithm (sea) for large-scale classification. In Proceedings of the Seventh ACM SIGKDD international conference on knowledge discovery and data mining, pp. 377\u2013382","DOI":"10.1145\/502512.502568"},{"issue":"8","key":"6218_CR53","doi-asserted-by":"publisher","first-page":"7067","DOI":"10.1016\/j.eswa.2012.01.039","volume":"39","author":"SB Taieb","year":"2012","unstructured":"Taieb, S. B., Bontempi, G., Atiya, A. F., & Sorjamaa, A. (2012). A review and comparison of strategies for multi-step ahead time series forecasting based on the nn5 forecasting competition. Expert Systems with Applications, 39(8), 7067\u20137083.","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"6218_CR54","doi-asserted-by":"publisher","first-page":"4793","DOI":"10.1109\/TNNLS.2020.3027314","volume":"32","author":"E Tjoa","year":"2020","unstructured":"Tjoa, E., & Guan, C. (2020). A survey on explainable artificial intelligence (xai): Toward medical xai. IEEE Transactions on Neural Networks and Learning Systems, 32(11), 4793\u20134813.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"6218_CR55","doi-asserted-by":"crossref","unstructured":"Tsoumakas, G., Partalas, I., & Vlahavas, I. (2009). An ensemble pruning primer. In: Applications of supervised and unsupervised ensemble methods, pp. 1\u201313. Springer.","DOI":"10.1007\/978-3-642-03999-7_1"},{"issue":"10","key":"6218_CR56","doi-asserted-by":"publisher","first-page":"2497","DOI":"10.1162\/08997660260293319","volume":"14","author":"PE Utgoff","year":"2002","unstructured":"Utgoff, P. E., & Stracuzzi, D. J. (2002). Many-layered learning. Neural Computation, 14(10), 2497\u20132529.","journal-title":"Neural Computation"},{"issue":"1","key":"6218_CR57","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10994-016-5592-6","volume":"106","author":"O Wintenberger","year":"2017","unstructured":"Wintenberger, O. (2017). Optimal learning with bernstein online aggregation. Machine Learning, 106(1), 119\u2013141.","journal-title":"Machine Learning"},{"issue":"7","key":"6218_CR58","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1162\/neco.1996.8.7.1341","volume":"8","author":"DH Wolpert","year":"1996","unstructured":"Wolpert, D. H. (1996). The lack of a priori distinctions between learning algorithms. Neural Computation, 8(7), 1341\u20131390.","journal-title":"Neural Computation"},{"key":"6218_CR59","unstructured":"Yu, Y., Li, Y.-F., & Zhou, Z.-H. (2011). Diversity regularized machine. In Twenty-second international joint conference on artificial intelligence."},{"key":"6218_CR60","doi-asserted-by":"crossref","unstructured":"Zablocki, \u00c9., Ben-Younes, H., P\u00e9rez, P., & Cord, M. (2021). Explainability of vision-based autonomous driving systems: Review and challenges. arXiv preprint arXiv:2101.05307","DOI":"10.1007\/s11263-022-01657-x"},{"key":"6218_CR61","first-page":"527","volume":"2","author":"T Zhang","year":"2002","unstructured":"Zhang, T. (2002). Covering number bounds of certain regularized linear function classes. Journal of Machine Learning Research, 2, 527\u2013550.","journal-title":"Journal of Machine Learning Research"},{"issue":"7","key":"6218_CR62","first-page":"1315","volume":"7","author":"Y Zhang","year":"2006","unstructured":"Zhang, Y., Burer, S., Nick Street, W., Bennett, K. P., & Parrado-Hern\u00e1ndez, E. (2006). Ensemble pruning via semi-definite programming. Journal of Machine Learning Research, 7(7), 1315.","journal-title":"Journal of Machine Learning Research"},{"key":"6218_CR63","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ins.2020.08.053","volume":"544","author":"S Zhang","year":"2021","unstructured":"Zhang, S., Chen, Y., Zhang, W., & Feng, R. (2021). A novel ensemble deep learning model with dynamic error correction and multi-objective ensemble pruning for time series forecasting. Information Sciences, 544, 427\u2013445.","journal-title":"Information Sciences"},{"key":"6218_CR64","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1007\/s13042-021-01302-y","volume":"12","author":"J Zhang","year":"2021","unstructured":"Zhang, J., Dai, Q., & Yao, C. (2021). Dep-tsp meta: A multiple criteria dynamic ensemble pruning technique ad-hoc for time series prediction. International Journal of Machine Learning and Cybernetics, 12, 2213.","journal-title":"International Journal of Machine Learning and Cybernetics"},{"key":"6218_CR65","doi-asserted-by":"crossref","unstructured":"Zhou, Z.-H., & Tang, W. (2003). Selective ensemble of decision trees. In: International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-soft Computing, pp. 476\u2013483. Springer","DOI":"10.1007\/3-540-39205-X_81"},{"issue":"1\u20132","key":"6218_CR66","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0004-3702(02)00190-X","volume":"137","author":"Z-H Zhou","year":"2002","unstructured":"Zhou, Z.-H., Wu, J., & Tang, W. (2002). Ensembling neural networks: Many could be better than all. Artificial intelligence, 137(1\u20132), 239\u2013263.","journal-title":"Artificial intelligence"},{"key":"6218_CR67","unstructured":"Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th International Conference on Machine Learning (icml-03), pp. 928\u2013936."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06218-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06218-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06218-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T19:13:51Z","timestamp":1663269231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06218-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":67,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["6218"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06218-4","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"10 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}