CART-ELC: Oblique Decision Tree Induction via Exhaustive Search

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Laack, Andrew D.
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Artificial Intelligence Data Structures and Algorithms I.2.6; I.5.2; F.2.2; G.3; G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Systematic Alias Sampling: an efficient and low-variance way to sample from a discrete distribution
by: Vallivaara, Ilari, et al.
Published: (2025)

Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025)

Learning Nonlinear Regime Transitions via Semi-Parametric State-Space Models
by: Hiremath, Prakul Sunil
Published: (2026)

First-Mover Bias in Gradient Boosting Explanations: Mechanism, Detection, and Resolution
by: Caraker, Drake, et al.
Published: (2026)

EXCODER: EXplainable Classification Of DiscretE time series Representations
by: Hahn, Yannik, et al.
Published: (2026)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)

Unified Unbiased Variance Estimation for Maximum Mean Discrepancy: Robust Finite-Sample Performance with Imbalanced Data and Exact Acceleration under Null and Alternative Hypotheses
by: Zhong, Shijie, et al.
Published: (2026)

The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
by: Gila, Ofek, et al.
Published: (2025)

Variational Search Distributions
by: Steinberg, Daniel M., et al.
Published: (2024)

Closed-Form Beta Distribution Estimation from Sparse Statistics with Random Forest Implicit Regularization
by: Landers, Jonathan R.
Published: (2025)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
by: Bhattacharjee, Rajarshi, et al.
Published: (2024)

Front-door Reducibility: Reducing ADMGs to the Standard Front-door Setting via a Graphical Criterion
by: Mao, Jianqiao, et al.
Published: (2025)

Graph Neural Networks are Heuristics
by: Min, Yimeng, et al.
Published: (2026)

Vision-Guided Iterative Refinement for Frontend Code Generation
by: Sansford, Hannah, et al.
Published: (2026)

Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications
by: Allagan, J., et al.
Published: (2025)

On the cohesion and separability of average-link for hierarchical agglomerative clustering
by: Laber, Eduardo Sany, et al.
Published: (2024)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

Scattered Forest Search: Smarter Code Space Exploration with LLMs
by: Light, Jonathan, et al.
Published: (2024)

Signotopes Induce Unique Sink Orientations on Grids
by: Roch, Sandro M.
Published: (2026)

ASD-Bench: A Four-Axis Comprehensive Benchmark of AI Models for Autism Spectrum Disorder
by: Singh, Shubhankit, et al.
Published: (2026)

Discovering Algorithms with Computational Language Processing
by: Bourdais, Theo, et al.
Published: (2025)

Ancestry Tree Clustering for Particle Filter Diversity Maintenance
by: Vallivaara, Ilari, et al.
Published: (2025)

A Multidisciplinary Approach to Telegram Data Analysis
by: Varbanov, Velizar, et al.
Published: (2024)

Ternary Decision Trees with Locally-Adaptive Uncertainty Zones
by: Smits, William
Published: (2026)

4OPS: Structural Difficulty Modeling in Integer Arithmetic Puzzles
by: Zeytuncu, Yunus E.
Published: (2026)

Non-Heuristic Selection via Hybrid Regularized and Machine Learning Models for Insurance
by: Galvão, Luciano Ribeiro, et al.
Published: (2025)

EchoLSTM: A Self-Reflective Recurrent Network for Stabilizing Long-Range Memory
by: K, Prasanth K, et al.
Published: (2025)

Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation
by: Peterseim, Benedikt, et al.
Published: (2026)

Structural Parameterization of Steiner Tree Packing
by: Hastrich, Niko, et al.
Published: (2025)

Maintaining Routing Structures under Deletions via Self-Pruning
by: Haeupler, Bernhard, et al.
Published: (2025)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
by: Haeupler, Bernhard, et al.
Published: (2023)

Tensor Manifold-Based Graph-Vector Fusion for AI-Native Academic Literature Retrieval
by: Wei, Xing, et al.
Published: (2026)

Graph Coloring for Multi-Task Learning
by: Patapati, Santosh
Published: (2025)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
by: Salas, Jesus
Published: (2025)

Assessing the Performance-Efficiency Trade-off of Foundation Models in Probabilistic Electricity Price Forecasting
by: Lettner, Jan Niklas, et al.
Published: (2026)

The Maximum Clique Problem in a Disk Graph Made Easy
by: Keil, J. Mark, et al.
Published: (2024)

A Simple yet Exact Analysis of the MultiQueue
by: Walzer, Stefan, et al.
Published: (2024)

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
by: Kosoy, Vanessa
Published: (2026)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)