HHCART: An Oblique Decision Tree

14 April 2015

D. C. Wickramarachchi

Papers citing "HHCART: An Oblique Decision Tree"

11 / 11 papers shown

Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach

Philippe Chlenski

I. Pe’er

268

04 Jun 2025

A novel gradient-based method for decision trees optimizing arbitrary differential loss functions

A. Konstantinov

Lev V. Utkin

298

22 Mar 2025

Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules

Xi He

Max A. Little

320

03 Mar 2025

FoLDTree: A ULDA-Based Decision Tree Framework for Efficient Oblique Splits and Feature Selection

Siyu Wang

Kehui Yao

114

30 Oct 2024

Multiple Instance Learning with Trainable Decision Tree Ensembles

A. Konstantinov

Lev V. Utkin

221

13 Feb 2023

OF-AE: Oblique Forest AutoEncodersArtificial Intelligence Applications and Innovations (AIAI), 2023

C. Alecsa

189

02 Jan 2023

Margin Optimal Classification TreesComputers & Operations Research (COR), 2022

618

19 Oct 2022

Mixed integer linear optimization formulations for learning optimal binary classification trees

B. Alston

Hamidreza Validi

Illya V. Hicks

233

10 Jun 2022

A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees

311

06 Nov 2020

Convex Polytope Trees

Mohammadreza Armandpour

Mingyuan Zhou

223

21 Oct 2020

Oblique Decision Trees from Derivatives of ReLU NetworksInternational Conference on Learning Representations (ICLR), 2019

Guang-He Lee

Tommi Jaakkola

141

30 Sep 2019