Multiclass Optimal Classification Trees with SVM-splits

11/16/2021
by   Víctor Blanco, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2020

Robust Optimal Classification Trees under Noisy Labels

In this paper we propose a novel methodology to construct Optimal Classi...
research
10/22/2018

Optimal arrangements of hyperplanes for multiclass classification

In this paper, we present a novel approach to construct multiclass clasi...
research
11/18/2022

A Mathematical Programming Approach to Optimal Classification Forests

In this paper we propose a novel mathematical optimization based methodo...
research
04/21/2020

A Mathematical Programming approach to Binary Supervised Classification with Label Noise

In this paper we propose novel methodologies to construct Support Vector...
research
05/28/2022

Feature subset selection for kernel SVM classification via mixed-integer optimization

We study the mixed-integer optimization (MIO) approach to feature subset...
research
05/28/2022

Optimal Decision Diagrams for Classification

Decision diagrams for classification have some notable advantages over d...
research
10/27/2017

An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples

The literature on Multiple Criteria Decision Analysis (MCDA) proposes se...

Please sign up or login with your details

Forgot password? Click here to reset