Multiclass Optimal Classification Trees with SVM-splits
In this paper we present a novel mathematical optimization-based methodology to construct tree-shaped classification rules for multiclass instances. Our approach consists of building Classification Trees in which, except for the leaf nodes, the labels are temporarily left out and grouped into two classes by means of a SVM separating hyperplane. We provide a Mixed Integer Non Linear Programming formulation for the problem and report the results of an extended battery of computational experiments to assess the performance of our proposal with respect to other benchmarking classification methods.
Code (0)
등록된 구현이 없습니다.
Tasks
BenchmarkingClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Optimal Control of Multiclass Fluid Queueing Networks: A Machine Learning Approach
We propose a machine learning approach to the optimal control of multiclass fluid queueing networks (MFQNETs) that provides explicit and insightful control policies. We prove that a threshold type optimal policy exists f…
Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
Computing an optimal classification tree that provably maximizes training performance within a given size limit, is NP-hard, and in practice, most state-of-the-art methods do not scale beyond computing optimal trees of d…
BinarizationWhen does Subagging Work?
We study the effectiveness of subagging, or subsample aggregating, on regression trees, a popular non-parametric method in machine learning. First, we give sufficient conditions for pointwise consistency of trees. We for…
Universal Rates for Multiclass Learning
We study universal rates for multiclass classification, establishing the optimal rates (up to log factors) for all hypothesis classes. This generalizes previous results on binary classification (Bousquet, Hanneke, Moran,…
Binary ClassificationAsymmetric Impurity Functions, Class Weighting, and Optimal Splits for Binary Classification Trees
We investigate how asymmetrizing an impurity function affects the choice of optimal node splits when growing a decision tree for binary classification. In particular, we relax the usual axioms of an impurity function and…
Binary ClassificationGeneral Classification