A branch \& bound algorithm to determine optimal cross-splits for decision tree induction

DOI10.1007/S10472-019-09684-0zbMATH Open1435.68254OpenAlexW2996919918MaRDI QIDQ2188762FDOQ2188762

Ferdinand Bollwein, Martin Dahmen, Stephan Westphal

Publication date: 11 June 2020

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-019-09684-0

Recommendations

• 10.1162/jmlr.2003.3.4-5.621
• Optimal classification trees
• Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution
• Optimal classification trees
• General and efficient multisplitting of numerical attributes

zbMATH Keywords

classificationdecision treesbranch and boundcross-splits

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Cites Work

• The elements of statistical learning. Data mining, inference, and prediction
• Title not available (Why is that?)
• Breast Cancer Diagnosis and Prognosis Via Linear Programming
• Multivariate decision trees
• Constructing optimal binary decision trees is NP-complete
• Title not available (Why is that?)
• Technical note: Some properties of splitting criteria

Cited In (3)

• bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition
• Title not available (Why is that?)
• 10.1162/jmlr.2003.3.4-5.621

Uses Software

• UCI-ml

This page was built for publication: A branch \& bound algorithm to determine optimal cross-splits for decision tree induction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188762)