A branch & bound algorithm to determine optimal cross-splits for decision tree induction
Crossref DOI link: https://doi.org/10.1007/s10472-019-09684-0
Published Online: 2020-01-03
Published Print: 2020-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bollwein, Ferdinand http://orcid.org/0000-0002-4894-5615
Dahmen, Martin
Westphal, Stephan
Text and Data Mining valid from 2020-01-03
Version of Record valid from 2020-01-03
Article History
First Online: 3 January 2020