HHCART: an oblique decision tree

DOI10.1016/j.csda.2015.11.006zbMath1468.62209arXiv1504.03415OpenAlexW2188236168WikidataQ60401410 ScholiaQ60401410MaRDI QIDQ1659462

Y. Aharonov

Publication date: 15 August 2018

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.03415

zbMATH Keywords

machine learningHouseholder reflectionstatistical learningdata classificationoblique decision tree

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

Mathematical optimization in classification and regression trees ⋮ Margin optimal classification trees ⋮ A reflected feature space for CART ⋮ Optimal classification trees ⋮ Classification tree algorithm for grouped variables ⋮ HHCART ⋮ Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution

Uses Software

• UCI-ml
• CARTopt

Cites Work

• CARTopt: a random search method for nonsmooth unconstrained optimization
• Constructing optimal binary decision trees is NP-complete
• Linear tree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: HHCART: an oblique decision tree