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

DOI10.1007/S00180-022-01317-1MaRDI QIDQ6567426FDOQ6567426

Authors: Ferdinand Bollwein 

Publication date: 5 July 2024

Published in: Computational Statistics (Search for Journal in Brave)

zbMATH Keywords

simulated annealingclassificationregressionoblique decision trees

Mathematics Subject Classification ID

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

Cites Work

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

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)