paper-with-me

홈 › Papers

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

2024-10-30 · Siyu Wang, Kehui Yao

Traditional decision trees are limited by axis-orthogonal splits, which can perform poorly when true decision boundaries are oblique. While oblique decision tree methods address this limitation, they often face high computational costs, difficulties with multi-class classification, and a lack of effective feature selection. In this paper, we introduce LDATree and FoLDTree, two novel frameworks that integrate Uncorrelated Linear Discriminant Analysis (ULDA) and Forward ULDA into a decision tree structure. These methods enable efficient oblique splits, handle missing values, support feature selection, and provide both class labels and probabilities as model outputs. Through evaluations on simulated and real-world datasets, LDATree and FoLDTree consistently outperform axis-orthogonal and other oblique decision tree methods, achieving accuracy levels comparable to the random forest. The results highlight the potential of these frameworks as robust alternatives to traditional single-tree methods.

📄 PDF Abstract BibTeX arXiv:2410.23147

Code (0)

등록된 구현이 없습니다.

Tasks

feature selectionMissing ValuesMulti-class Classification

Similar Papers 제목 키워드 기반

A System for Induction of Oblique Decision Trees

1994-08-01 · S. K. Murthy, S. Kasif, S. Salzberg

This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to find a good oblique split (in the form of a hyperplan…

Weighted Oblique Decision Trees

2019-07-17 · Bin-Bin Yang, Song-Qing Shen, Wei Gao

Decision trees have attracted much attention during the past decades. Previous decision trees include axis-parallel and oblique decision trees; both of them try to find the best splits via exhaustive search or heurist…

ODTE -- An ensemble of multi-class SVM-based oblique decision trees

2024-11-20 · Ricardo Montañana, José A. Gámez, José M. Puerta

We propose ODTE, a new ensemble that uses oblique decision trees as base classifiers. Additionally, we introduce STree, the base algorithm for growing oblique decision trees, which leverages support vector machines to de…

Binary Classification

Oblique Bayesian additive regression trees

2024-11-13 · Paul-Hieu V. Nguyen, Ryan Yee, Sameer K. Deshpande

Current implementations of Bayesian Additive Regression Trees (BART) are based on axis-aligned decision rules that recursively partition the feature space using a single feature at a time. Several authors have demonstrat…

regression

CART-ELC: Oblique Decision Tree Induction via Exhaustive Search

2025-05-08 · Andrew D. Laack

Oblique decision trees have attracted attention due to their potential for improved classification performance over traditional axis-aligned decision trees. However, methods that rely on exhaustive search to find oblique…

Classification