{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,13]],"date-time":"2026-09-13T03:56:46Z","timestamp":1789271806346,"version":"build-2803163510"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T00:00:00Z","timestamp":1634774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T00:00:00Z","timestamp":1634774400000},"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":"publisher","award":["HO6422\/1-2"],"award-info":[{"award-number":["HO6422\/1-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005722","name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005722","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The diversity forest algorithm is an alternative candidate node split sampling scheme that makes innovative complex split procedures in random forests possible. While conventional univariable, binary splitting suffices for obtaining strong predictive performance, new complex split procedures can help tackling practically important issues. For example, interactions between features can be exploited effectively by bivariable splitting. With diversity forests, each split is selected from a candidate split set that is sampled in the following way: for\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$l = 1, \\dots , {nsplits}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>l<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>1<\/mml:mn>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mo>\u22ef<\/mml:mo>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mrow>\n                              <mml:mi>nsplits<\/mml:mi>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    : (1) sample one split problem; (2) sample a single or few splits from the split problem sampled in (1) and add this or these splits to the candidate split set. The split problems are specifically structured collections of splits that depend on the respective split procedure considered. This sampling scheme makes innovative complex split procedures computationally tangible while avoiding overfitting. Important general properties of the diversity forest algorithm are evaluated empirically using univariable, binary splitting. Based on 220 data sets with binary outcomes, diversity forests are compared with conventional random forests and random forests using extremely randomized trees. It is seen that the split sampling scheme of diversity forests does not impair the predictive performance of random forests and that the performance is quite robust with regard to the specified\n                    <jats:italic>nsplits<\/jats:italic>\n                    value. The recently developed interaction forests are the first diversity forest method that uses a complex split procedure. Interaction forests allow modeling and detecting interactions between features effectively. Further potential complex split procedures are discussed as an outlook.\n                  <\/jats:p>","DOI":"10.1007\/s42979-021-00920-1","type":"journal-article","created":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T12:09:48Z","timestamp":1634904588000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Diversity Forests: Using Split Sampling to Enable Innovative Complex Split Procedures in Random Forests"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6036-1495","authenticated-orcid":false,"given":"Roman","family":"Hornung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,21]]},"reference":[{"key":"920_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","volume":"106","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas D, Dunn J. Optimal classification trees. Mach Learn. 2017;106:1039\u201382. https:\/\/doi.org\/10.1007\/s10994-017-5633-9.","journal-title":"Mach Learn"},{"issue":"1\u20132","key":"920_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ins.2003.09.018","volume":"165","author":"F Berzal","year":"2004","unstructured":"Berzal F, Cubero JC, Mar\u00edn N, S\u00e1nchez D. Building multi-way decision trees with numerical attributes. Inf Sci. 2004;165(1\u20132):73\u201390. https:\/\/doi.org\/10.1016\/j.ins.2003.09.018.","journal-title":"Inf Sci"},{"key":"920_CR3","volume-title":"Out-of-bag estimation. Technical report, Department of Statistics","author":"L Breiman","year":"1996","unstructured":"Breiman L. Out-of-bag estimation. Technical report, Department of Statistics. Berkeley: University of California; 1996."},{"issue":"1","key":"920_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L. Random forests. Mach Learn. 2001;45(1):5\u201332. https:\/\/doi.org\/10.1023\/A:1010933404324.","journal-title":"Mach Learn"},{"key":"920_CR5","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139470","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman L, Friedman JH, Olshen RA, Ston CJ. Classification and regression trees. Monterey: Wadsworth International Group; 1984. https:\/\/doi.org\/10.1201\/9781315139470."},{"key":"920_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1023\/A:1022607123649","volume":"19","author":"CE Brodley","year":"1995","unstructured":"Brodley CE, Utgoff PE. Multivariate decision trees. Mach Learn. 1995;19:45\u201377. https:\/\/doi.org\/10.1023\/A:1022607123649.","journal-title":"Mach Learn"},{"key":"920_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s00180-019-00929-4","author":"P Calhoun","year":"2019","unstructured":"Calhoun P, Hallett MJ, Su X, Cafri G, Levine RA, Fan J. Random forest with acceptance-rejection trees. Comput Stat. 2019. https:\/\/doi.org\/10.1007\/s00180-019-00929-4.","journal-title":"Comput Stat"},{"key":"920_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.puhe.2020.04.016","volume":"185","author":"JS Cobb","year":"2020","unstructured":"Cobb JS, Seale MA. Examining the effect of social distancing on the compound growth rate of COVID-19 at the county level (united states) using statistical analyses and a random forest machine learning model. Public Health. 2020;185:27\u20139.","journal-title":"Public Health"},{"key":"920_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1186\/s12859-018-2264-5","volume":"19","author":"R Couronn\u00e9","year":"2018","unstructured":"Couronn\u00e9 R, Probst P, Boulesteix AL. Random forest versus logistic regression: a large-scale benchmark experiment. BMC Bioinform. 2018;19:270. https:\/\/doi.org\/10.1186\/s12859-018-2264-5.","journal-title":"BMC Bioinform"},{"key":"920_CR10","doi-asserted-by":"publisher","unstructured":"Fayyad UM, Irani KB. Multi-interval discretization of continuous-valued attributes for classification learning. In: Teh YW, Titterington M, editors, Proceedings of the thirteenth international join conference on artificial intelligence. pp. 1022\u20131027. https:\/\/doi.org\/10.1007\/978-3-642-40897-7_11.","DOI":"10.1007\/978-3-642-40897-7_11"},{"issue":"1","key":"920_CR11","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":"1","key":"920_CR12","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. https:\/\/doi.org\/10.1007\/s10994-006-6226-1.","journal-title":"Mach Learn"},{"key":"920_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11222-012-9349-1","volume":"24","author":"A Hapfelmeier","year":"2014","unstructured":"Hapfelmeier A, Hothorn T, Ulm K, Strobl C. A new variable importance measure for random forests with missing data. Stat Comput. 2014;24:21\u201334. https:\/\/doi.org\/10.1007\/s11222-012-9349-1.","journal-title":"Stat Comput"},{"key":"920_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00357-018-9302-x","volume":"37","author":"R Hornung","year":"2020","unstructured":"Hornung R. Ordinal forests. J Classif. 2020;37:4\u201317. https:\/\/doi.org\/10.1007\/s00357-018-9302-x.","journal-title":"J Classif"},{"key":"920_CR15","doi-asserted-by":"publisher","unstructured":"Hornung R, Boulesteix AL. Interaction forests: identifying and exploiting interpretable quantitative and qualitative interaction effects. Technical Report 237, Department of Statistics, University of Munich, 2021. https:\/\/doi.org\/10.5282\/ubm\/epub.75269.","DOI":"10.5282\/ubm\/epub.75269"},{"key":"920_CR16","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1214\/08-AOAS169","volume":"2","author":"H Ishwaran","year":"2008","unstructured":"Ishwaran H, Kogalur UB, Blackstone EH, Lauer MS. Random survival forests. Ann Appl Stat. 2008;2:841\u201360. https:\/\/doi.org\/10.1214\/08-AOAS169.","journal-title":"Ann Appl Stat"},{"key":"920_CR17","doi-asserted-by":"publisher","first-page":"357","DOI":"10.3389\/fpubh.2020.00357","volume":"8","author":"C Iwendi","year":"2020","unstructured":"Iwendi C, Bashir AK, Peshkar A, Sujatha R, Chatterjee JM, Pasupuleti S, Mishra R, Pillai S, Jo O. COVID-19 patient health prediction using boosted random forest algorithm. Front Public Health. 2020;8:357.","journal-title":"Front Public Health"},{"key":"920_CR18","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0201904","author":"S Janitza","year":"2018","unstructured":"Janitza S, Hornung R. On the overestimation of random forest\u2019s out-of-bag error. PLoS One. 2018. https:\/\/doi.org\/10.1371\/journal.pone.0201904.","journal-title":"PLoS One"},{"key":"920_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.107078","volume":"99","author":"R Katuwal","year":"2020","unstructured":"Katuwal R, Suganthan PN, Zhang L. Heterogeneous oblique random forest. Pattern Recognit. 2020;99: 107078.","journal-title":"Pattern Recognit"},{"issue":"3","key":"920_CR20","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.patcog.2012.09.023","volume":"46","author":"D Kocev","year":"2013","unstructured":"Kocev D, Vens C, Struyf J, D\u017eeroski S. Tree ensembles for predicting structured outputs. Pattern Recognit. 2013;46(3):817\u201333. https:\/\/doi.org\/10.1016\/j.patcog.2012.09.023.","journal-title":"Pattern Recognit"},{"key":"920_CR21","doi-asserted-by":"crossref","unstructured":"Menze BH, Kelm BM, Splitthoff DN, Koethe U, Hamprecht FA. On oblique random forests. In: Gunopulos D, Hofmann T, Malerba D, Vazirgiannis M, editors, European conference on machine learning and principles and practice of knowledge discovery in databases. Berlin, Heidelberg: Springer. pp. 453\u2013469.","DOI":"10.1007\/978-3-642-23783-6_29"},{"key":"920_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.63","volume":"2","author":"SK Murthy","year":"1994","unstructured":"Murthy SK, Kasif S, Salzberg S. A system for induction of oblique decision trees. J Artif Intell Res. 1994;2:1\u201332. https:\/\/doi.org\/10.1613\/jair.63.","journal-title":"J Artif Intell Res"},{"key":"920_CR23","first-page":"867","volume-title":"Treatment of cancer","author":"R Peto","year":"1982","unstructured":"Peto R. Statistical aspects of cancer trials. In: Halnam KE, editor. Treatment of cancer. London: Chapman & Hall; 1982. p. 867\u201371."},{"issue":"53","key":"920_CR24","first-page":"1","volume":"20","author":"P Probst","year":"2019","unstructured":"Probst P, Boulesteix AL, Bischl B. Tunability: importance of hyperparameters of machine learning algorithms. J Mach Learn Res. 2019;20(53):1\u201332.","journal-title":"J Mach Learn Res"},{"key":"920_CR25","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1186\/1471-2105-8-25","volume":"8","author":"C Strobl","year":"2007","unstructured":"Strobl C, Boulesteix AL, Zeileis A, Hothorn T. Bias in random forest variable importance measures: illustrations, sources and a solution. BMC Bioinform. 2007;8:25. https:\/\/doi.org\/10.1186\/1471-2105-8-25.","journal-title":"BMC Bioinform"},{"key":"920_CR26","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1002\/sim.7660","volume":"37","author":"X Su","year":"2018","unstructured":"Su X, Pena AT, Liu L, Levine RA. Random forests of interaction trees for estimating individualized treatment effects in randomized trials. Stat Med. 2018;37:2547\u201360. https:\/\/doi.org\/10.1002\/sim.7660.","journal-title":"Stat Med"},{"issue":"2","key":"920_CR27","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2641190.2641198","volume":"15","author":"J Vanschoren","year":"2014","unstructured":"Vanschoren J, van Rijn JN, Bischl B, Torgo L. OpenML: networked science in machine learning. ACM SIGKDD Explor News Lett. 2014;15(2):49\u201360. https:\/\/doi.org\/10.1145\/2641190.2641198.","journal-title":"ACM SIGKDD Explor News Lett"},{"key":"920_CR28","doi-asserted-by":"crossref","unstructured":"Wang QW, Yang L, Li YF. Learning from weak-label data: a deep forest expedition. In: Rossi F, Conitzer V, Sha F, editors, Proceedings of the AAAI conference on artificial intelligence. Burnaby: PKP Publishing Services. pp. 6251\u20136258.","DOI":"10.1609\/aaai.v34i04.6092"},{"key":"920_CR29","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.csda.2015.11.006","volume":"96","author":"DC Wickramarachchi","year":"2015","unstructured":"Wickramarachchi DC, Robertson BL, Reale M, Price CJ, Brown J. Hhcart: an oblique decision tree. Comput Stat Data Anal. 2015;96:12\u201323. https:\/\/doi.org\/10.1016\/j.csda.2015.11.006.","journal-title":"Comput Stat Data Anal"},{"issue":"1","key":"920_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v077.i01","volume":"77","author":"MN Wright","year":"2017","unstructured":"Wright MN, Ziegler A. Ranger: a fast implementation of random forests for high dimensional data in C++ and R. J Stat Softw. 2017;77(1):1\u201317. https:\/\/doi.org\/10.18637\/jss.v077.i01.","journal-title":"J Stat Softw"},{"key":"920_CR31","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1186\/s12859-016-0995-8","volume":"17","author":"MN Wright","year":"2016","unstructured":"Wright MN, Ziegler A, K\u00f6nig IR. Do little interactions get lost in dark random forests? BMC Bioinform. 2016;17:145. https:\/\/doi.org\/10.1186\/s12859-016-0995-8.","journal-title":"BMC Bioinform"},{"key":"920_CR32","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1136\/bmj.m1328","volume":"369","author":"L Wynants","year":"2020","unstructured":"Wynants L, Van Calster B, Collins GS, Riley RD, Heinze G, Schuit E, Bonten MMJ, Dahly DL, Damen JA, Debray TPA, et al. Prediction models for diagnosis and prognosis of COVID-19: systematic review and critical appraisal. BMJ. 2020;369:1328.","journal-title":"BMJ"},{"issue":"5","key":"920_CR33","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.ins.2006.08.014","volume":"177","author":"E Yen","year":"2007","unstructured":"Yen E, Chu IWM. Relaxing instance boundaries for the search of splitting points of numerical attributes in classification trees. Inf Sci. 2007;177(5):1276\u201389. https:\/\/doi.org\/10.1016\/j.ins.2006.08.014.","journal-title":"Inf Sci"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00920-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-021-00920-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00920-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T13:29:39Z","timestamp":1641821379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-021-00920-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,21]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["920"],"URL":"https:\/\/doi.org\/10.1007\/s42979-021-00920-1","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,21]]},"assertion":[{"value":"26 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The funding body German Science Foundation had no role in the design of the study and collection, analysis, and interpretation of data and in writing the manuscript. The author declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics 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"}}],"article-number":"1"}}