A pivot-based simulated annealing algorithm to determine oblique splits for decision tree induction

DOI10.1007/S00180-022-01317-1MaRDI QIDQ6567426zbMATH OpenFDO

Authors Ferdinand Bollwein

Publication date 5 July 2024

Published in Computational Statistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

simulated annealingclassificationregressionoblique decision trees

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 3624650 (Why is no real title available?)
• scientific article; zbMATH DE number 1149432 (Why is no real title available?)
• scientific article; zbMATH DE number 1538127 (Why is no real title available?)
• A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• A reflected feature space for cart
• Equation of state calculations by fast computing machines
• HHCART: an oblique decision tree
• Handbook of metaheuristics
• Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution
• Optimal classification trees
• Optimal randomized classification trees
• Scikit-learn: machine learning in Python
• Sparsity in optimal randomized classification trees
• Statistical comparisons of classifiers over multiple data sets
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• The use of ranks to avoid the assumption of normality implicit in the analysis of variance.

This page was built for publication: A pivot-based simulated annealing algorithm to determine oblique splits for decision tree induction

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