{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T19:16:12Z","timestamp":1792782972579,"version":"4.5.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T00:00:00Z","timestamp":1789603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T00:00:00Z","timestamp":1789603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Pontif\u00edcia Universidade Cat\u00f3lica Do Paran\u00e1","id":[{"id":"https:\/\/ror.org\/02x1vjk79","id-type":"ROR","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2026,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Ensembles of decision trees are well-established methods for data stream classification. In ensemble learning, Hoeffding Trees are widely adopted as base learners, performing periodic split attempts according to the Hoeffding bound. Recent studies, however, indicate that this standard splitting mechanism lacks adaptability, while adaptive trees that trigger splits in response to performance degradation have achieved superior results. In this paper, we identify limitations in the use of adaptive-splitting decision trees as ensemble base learners, showing that change detectors often fail to promote sufficient diversity within ensembles. To address this issue, we propose two novel decision tree models, termed Hoeffding Adaptive Splitting Trees. These models combine the periodic splitting strategy of Hoeffding Trees, which fosters ensemble diversity, with adaptive splitting mechanisms that employ change detection algorithms to identify performance decay and determine split points. Experimental results demonstrate that Hoeffding Adaptive Splitting Trees enhance ensemble performance and achieve state-of-the-art results across a comprehensive evaluation, including benchmark comparisons, computational cost analysis, and concept drift adaptation.<\/jats:p>","DOI":"10.1007\/s10618-026-01255-2","type":"journal-article","created":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T09:47:10Z","timestamp":1789638430000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hoeffding adaptive splitting trees for data stream classification with concept drift and ensemble learning"],"prefix":"10.1007","volume":"40","author":[{"given":"Daniel","family":"Nowak Assis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean Paul","family":"Barddal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabr\u00edcio","family":"Enembreck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,9,17]]},"reference":[{"issue":"6","key":"1255_CR1","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/69.250074","volume":"5","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Database mining: a performance perspective. IEEE Trans on Knowl and Data Eng 5(6):914\u2013925. https:\/\/doi.org\/10.1109\/69.250074","journal-title":"IEEE Trans on Knowl and Data Eng"},{"key":"1255_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111535","volume":"289","author":"GJ Aguiar","year":"2024","unstructured":"Aguiar GJ, Cano A (2024) A comprehensive analysis of concept drift locality in data streams. Knowl-Based Syst 289:111535. https:\/\/doi.org\/10.1016\/j.knosys.2024.111535","journal-title":"Knowl-Based Syst"},{"key":"1255_CR3","doi-asserted-by":"publisher","first-page":"4165","DOI":"10.1007\/s10994-023-06353-6","volume":"113","author":"G Aguiar","year":"2024","unstructured":"Aguiar G, Cano A, Krawczyk B (2024) A survey on learning from imbalanced data streams: taxonomy, challenges, empirical study, and reproducible experimental framework. Mach Learn 113:4165\u20134243","journal-title":"Mach Learn"},{"key":"1255_CR4","doi-asserted-by":"crossref","unstructured":"Assis DN, Barddal JP, Enembreck F (2024) Just change on change: adaptive splitting time for decision trees in data stream classification. Proceedings of ACM SAC conference (SAC\u201924). ACM SAC\u2019 24. Association for computing machinery, New York, NY, USA","DOI":"10.1145\/3605098.3635899"},{"key":"1255_CR5","doi-asserted-by":"publisher","unstructured":"Barddal JP, Enembreck F (2019) Learning regularized hoeffding trees from data streams. SAC \u201919, association for computing machinery, New York, USA, pp 574\u2013581. https:\/\/doi.org\/10.1145\/3297280.3297334","DOI":"10.1145\/3297280.3297334"},{"key":"1255_CR6","doi-asserted-by":"publisher","unstructured":"Barros RSMd, Carvalho\u00a0Santos S, Gon\u00e7alves\u00a0J\u00fanior PM (2016) A boosting-like online learning ensemble. In: 2016 international joint conference on neural networks (IJCNN), pp 1871\u20131878. https:\/\/doi.org\/10.1109\/IJCNN.2016.7727427","DOI":"10.1109\/IJCNN.2016.7727427"},{"issue":"5","key":"1255_CR7","first-page":"1","volume":"17","author":"A Benavoli","year":"2016","unstructured":"Benavoli A, Corani G, Mangili F (2016) Should we really use post-hoc tests based on mean-ranks? J Mach Learn Res 17(5):1\u201310","journal-title":"J Mach Learn Res"},{"key":"1255_CR8","doi-asserted-by":"publisher","unstructured":"Bifet A, Gavald\u00e0 R (2007) Learning from time-changing data with adaptive windowing, vol 7. https:\/\/doi.org\/10.1137\/1.9781611972771.42","DOI":"10.1137\/1.9781611972771.42"},{"key":"1255_CR9","doi-asserted-by":"crossref","unstructured":"Bifet A, Holmes G, Pfahringer B (2010) Leveraging bagging for evolving data streams. In: Machine learning and knowledge discovery in databases. Springer, Berlin, Heidelberg, pp 135\u2013150","DOI":"10.1007\/978-3-642-15880-3_15"},{"key":"1255_CR10","unstructured":"Bifet A, Holmes G, Pfahringer B, Kranen P, Kremer H, Jansen T, Seidl T (2010) Moa: massive online analysis, a framework for stream classification and clustering. Proceedings of the First Workshop on Applications of Pattern Analysis. PMLR, pp 44\u201350"},{"key":"1255_CR11","doi-asserted-by":"publisher","unstructured":"Bifet A, Holmes G, Pfahringer B, Kirkby R, Gavald\u00e0 R (2009) New ensemble methods for evolving data streams. KDD \u201909. Association for computing machinery, New York, USA, pp 139\u2013148. https:\/\/doi.org\/10.1145\/1557019.1557041","DOI":"10.1145\/1557019.1557041"},{"key":"1255_CR12","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman L (1984) Classification and regression trees. Wadsworth Statistics, Wadsworth, Belmont, CA"},{"issue":"1","key":"1255_CR13","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. https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach Learn"},{"key":"1255_CR14","doi-asserted-by":"crossref","unstructured":"Breiman L (1996) Bagging predictors. In: Machine learning, vol 24. Springer, pp 123\u2013140","DOI":"10.1023\/A:1018054314350"},{"key":"1255_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10994-019-05840-z","volume":"109","author":"A Cano","year":"2019","unstructured":"Cano A, Krawczyk B (2019) Kappa updated ensemble for drifting data stream mining. Mach Learn 109:175\u2013218","journal-title":"Mach Learn"},{"key":"1255_CR16","doi-asserted-by":"publisher","first-page":"2561","DOI":"10.1007\/s10994-022-06168-x","volume":"111","author":"A Cano","year":"2022","unstructured":"Cano A, Krawczyk B (2022) Rose: robust online self-adjusting ensemble for continual learning on imbalanced drifting data streams. Mach Learn 111:2561\u20132599","journal-title":"Mach Learn"},{"key":"1255_CR17","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"issue":"1","key":"1255_CR18","first-page":"263","volume":"2","author":"TG Dietterich","year":"1995","unstructured":"Dietterich TG, Bakiri G (1995) Solving multiclass learning problems via error-correcting output codes. J Artif Int Res 2(1):263\u2013286","journal-title":"J Artif Int Res"},{"key":"1255_CR19","doi-asserted-by":"publisher","unstructured":"Domingos P, Hulten G (2000) Mining high-speed data streams. In: Proceedings of the sixth ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201900. Association for Computing Machinery, New York, USA, pp 71\u201380 https:\/\/doi.org\/10.1145\/347090.347107","DOI":"10.1145\/347090.347107"},{"key":"1255_CR20","unstructured":"Freund Y, Schapire RE (1996) Experiments with a new boosting algorithm. Proceedings of the Thirteenth International Conference on International Conference on Machine Learning. ICML\u201996. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA, pp 148\u2013156"},{"issue":"3","key":"1255_CR21","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1109\/TKDE.2014.2345382","volume":"27","author":"I Fr\u00edas-Blanco","year":"2015","unstructured":"Fr\u00edas-Blanco I, Campo-\u00c1vila JD, Ramos-Jim\u00e9nez G, Morales-Bueno R, Ortiz-D\u00edaz A, Caballero-Mota Y (2015) Online and non-parametric drift detection methods based on Hoeffding\u2019s bounds. IEEE Trans Knowl Data Eng 27(3):810\u2013823. https:\/\/doi.org\/10.1109\/TKDE.2014.2345382","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1255_CR22","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10994-012-5320-9","volume":"90","author":"J Gama","year":"2013","unstructured":"Gama J, Sebasti\u00e3o R, Rodrigues PP (2013) On evaluating stream learning algorithms. Mach Learn 90:317\u2013346","journal-title":"Mach Learn"},{"key":"1255_CR23","doi-asserted-by":"publisher","DOI":"10.1145\/2523813","author":"J Gama","year":"2014","unstructured":"Gama J, \u017dliobaite I, Bifet A, Pechenizkiy M, Bouchachia A (2014) A survey on concept drift adaptation. ACM Comput Surv. https:\/\/doi.org\/10.1145\/2523813","journal-title":"ACM Comput Surv"},{"key":"1255_CR24","doi-asserted-by":"publisher","unstructured":"Gama J, Rocha R, Medas P (2003) Accurate decision trees for mining high-speed data streams. KDD \u201903. Association for computing machinery. New York, USA, pp 523\u2013528. https:\/\/doi.org\/10.1145\/956750.956813","DOI":"10.1145\/956750.956813"},{"issue":"89","key":"1255_CR25","first-page":"2677","volume":"9","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S, Herrera F (2008) An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u2019\u2019 for all pairwise comparisons. J Mach Learn Res 9(89):2677\u20132694","journal-title":"J Mach Learn Res"},{"key":"1255_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2005","unstructured":"Geurts P, Ernst D, Wehenkel L (2005) Extremely randomized trees. Mach Learn 63:3\u201342","journal-title":"Mach Learn"},{"key":"1255_CR27","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1007\/s10994-017-5642-8","volume":"106","author":"HM Gomes","year":"2017","unstructured":"Gomes HM, Bifet A, Read J, Barddal JP, Enembreck F, Pfharinger B, Holmes G, Abdessalem T (2017) Adaptive random forests for evolving data stream classification. Mach Learn 106:1469\u20131495","journal-title":"Mach Learn"},{"key":"1255_CR28","doi-asserted-by":"publisher","unstructured":"Gomes HM, Read J, Bifet A (2019) Streaming random patches for evolving data stream classification. In: 2019 IEEE international conference on data mining (ICDM), pp 240\u2013249. https:\/\/doi.org\/10.1109\/ICDM.2019.00034","DOI":"10.1109\/ICDM.2019.00034"},{"key":"1255_CR29","doi-asserted-by":"publisher","first-page":"3325","DOI":"10.1007\/s10994-024-06517-y","volume":"113","author":"N Gunasekara","year":"2024","unstructured":"Gunasekara N, Pfahringer B, Gomes H, Bifet A (2024) Gradient boosted trees for evolving data streams. Mach Learn 113:3325\u20133352","journal-title":"Mach Learn"},{"key":"1255_CR30","doi-asserted-by":"crossref","unstructured":"Hoeffding W (1963) Probability inequalities for sums of bounded random variables. In: The collected works of Wassily Hoeffding. pp 409\u2013426","DOI":"10.1007\/978-1-4612-0865-5_26"},{"key":"1255_CR31","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/11564126_50","volume-title":"Knowledge discovery in databases: PKDD 2005","author":"G Holmes","year":"2005","unstructured":"Holmes G, Kirkby R, Pfahringer B (2005) Stress-testing hoeffding trees. In: Jorge AM, Torgo L, Brazdil P, Camacho R, Gama J (eds) Knowledge discovery in databases: PKDD 2005. Springer, Berlin, Heidelberg, pp 495\u2013502"},{"key":"1255_CR32","doi-asserted-by":"crossref","unstructured":"Holmes G, Kirkby R, Pfahringer B (2005) Stress-testing hoeffding trees. In: Knowledge discovery in databases: PKDD 2005. Springer, Berlin, Heidelberg, pp. 495\u2013502","DOI":"10.1007\/11564126_50"},{"key":"1255_CR33","doi-asserted-by":"crossref","unstructured":"Hulten G, Spencer L, Domingos P (2001) Mining time-changing data streams. Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201901. Association for Computing Machinery, New York, NY, USA, pp 97\u2013106","DOI":"10.1145\/502512.502529"},{"key":"1255_CR34","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/A:1022859003006","volume":"51","author":"LI Kuncheva","year":"2003","unstructured":"Kuncheva LI, Whitaker CJ (2003) Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy. Mach Learn 51:181\u2013207","journal-title":"Mach Learn"},{"key":"1255_CR35","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-33460-3_28","volume-title":"Machine learning and knowledge discovery in databases","author":"G Louppe","year":"2012","unstructured":"Louppe G, Geurts P (2012) Ensembles on random patches. In: Flach PA, De Bie T, Cristianini N (eds) Machine learning and knowledge discovery in databases. Springer, Berlin, Heidelberg, pp 346\u2013361"},{"issue":"12","key":"1255_CR36","doi-asserted-by":"publisher","first-page":"2346","DOI":"10.1109\/TKDE.2018.2876857","volume":"31","author":"J Lu","year":"2019","unstructured":"Lu J, Liu A, Dong F, Gu F, Gama J, Zhang G (2019) Learning under concept drift: a review. IEEE Trans Knowl Data Eng 31(12):2346\u20132363. https:\/\/doi.org\/10.1109\/TKDE.2018.2876857","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1255_CR37","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/s10618-021-00816-x","volume":"36","author":"C Manapragada","year":"2022","unstructured":"Manapragada C, Gomes HM, Salehi M, Bifet A, Webb GI (2022) An eager splitting strategy for online decision trees in ensembles. Data Min Knowl Disc 36:566\u2013619","journal-title":"Data Min Knowl Disc"},{"key":"1255_CR38","doi-asserted-by":"publisher","unstructured":"Manapragada C, Webb GI, Salehi M (2018) Extremely fast decision tree. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. KDD \u201918. Association for computing machinery, New York, USA, pp 1953\u20131962 https:\/\/doi.org\/10.1145\/3219819.3220005","DOI":"10.1145\/3219819.3220005"},{"key":"1255_CR39","doi-asserted-by":"publisher","first-page":"5751","DOI":"10.1007\/s10115-025-02395-5","volume":"67","author":"D Nowak Assis","year":"2025","unstructured":"Nowak Assis D, Barddal JP, Enembreck F (2025) Behavioral insights of adaptive splitting decision trees in evolving data stream classification. Knowl Inf Syst 67:5751","journal-title":"Knowl Inf Syst"},{"key":"1255_CR40","unstructured":"Oza NC, Russell SJ (2001) Online bagging and boosting. In: Proceedings of the eighth international workshop on artificial intelligence and statistics. Proceedings of Machine Learning Research, vol. R3. PMLR, pp 229\u2013236"},{"key":"1255_CR41","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.patrec.2024.02.026","volume":"180","author":"AM Paim","year":"2024","unstructured":"Paim AM, Enembreck F (2024) Adaptive regularized ensemble for evolving data stream classification. Pattern Recogn Lett 180:55\u201361. https:\/\/doi.org\/10.1016\/j.patrec.2024.02.026","journal-title":"Pattern Recogn Lett"},{"key":"1255_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.112830","volume":"309","author":"AM Paim","year":"2024","unstructured":"Paim AM, Enembreck F (2024) Adaptive random tree ensemble for evolving data stream classification. Knowl-Based Syst 309:112830. https:\/\/doi.org\/10.1016\/j.knosys.2024.112830","journal-title":"Knowl-Based Syst"},{"key":"1255_CR43","unstructured":"Quinlan JR (1992) C4.5: programs for machine. Morgan Kaufmann Publishers"},{"key":"1255_CR44","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1007\/s10618-020-00698-5","volume":"34","author":"VM Souza","year":"2020","unstructured":"Souza VM, Reis DM, Maletzke AG, Batista GE (2020) Challenges in benchmarking stream learning algorithms with real-world data. Data Min Knowl Disc 34:1805\u20131858","journal-title":"Data Min Knowl Disc"},{"key":"1255_CR45","doi-asserted-by":"crossref","unstructured":"Street WN, 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. KDD \u201901. Association for Computing Machinery, New York, USA, pp 377\u2013382","DOI":"10.1145\/502512.502568"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-026-01255-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-026-01255-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-026-01255-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T09:47:19Z","timestamp":1789638439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-026-01255-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,17]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["1255"],"URL":"https:\/\/doi.org\/10.1007\/s10618-026-01255-2","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,17]]},"assertion":[{"value":"21 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no coflict of interest","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"91"}}