Tree oblique for regression with weighted support vector machine

DOI10.1007/S00180-025-01647-WMaRDI QIDQ6888195zbMATH OpenFDO

Authors Andrea Carta, Luca Frigau

Publication date 9 December 2025

Published in Computational Statistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00180-025-01647-W

zbMATH Keywords

classificationoblique decision treeregressionstatistical learningsupport vector machine

Mathematics Subject Classification ID

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

Cites work

• CARTopt: a random search method for nonsmooth unconstrained optimization
• Constructing optimal binary decision trees is NP-complete
• HHCART: an oblique decision tree
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 1089157 (Why is no real title available?)
• scientific article; zbMATH DE number 1149432 (Why is no real title available?)
• Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution
• PPtree: projection pursuit classification tree
• Random rotation ensembles
• Regularized target encoding outperforms traditional methods in supervised machine learning with high cardinality features
• Sparse projection oblique randomer forests
• Support-vector networks
• Tree-Structured Classification Via Generalized Discriminant Analysis

This page was built for publication: Tree oblique for regression with weighted support vector machine

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