Robust Optimal Classification Trees under Noisy Labels
In this paper we propose a novel methodology to construct Optimal Classification Trees that takes into account that noisy labels may occur in the training sample. Our approach rests on two main elements: (1) the splitting rules for the classification trees are designed to maximize the separation margin between classes applying the paradigm of SVM; and (2) some of the labels of the training sample are allowed to be changed during the construction of the tree trying to detect the label noise. Both features are considered and integrated together to design the resulting Optimal Classification Tree. We present a Mixed Integer Non Linear Programming formulation for the problem, suitable to be solved using any of the available off-the-shelf solvers. The model is analyzed and tested on a battery of standard datasets taken from UCI Machine Learning repository, showing the effectiveness of our approach.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationGeneral ClassificationSimilar Papers 제목 키워드 기반
Optimizing Feature Selection for Binary Classification with Noisy Labels: A Genetic Algorithm Approach
Feature selection in noisy label scenarios remains an understudied topic. We propose a novel genetic algorithm-based approach, the Noise-Aware Multi-Objective Feature Selection Genetic Algorithm (NMFS-GA), for selecting …
Binary Classificationfeature selectionPropensity-scored Probabilistic Label Trees
Extreme multi-label classification (XMLC) refers to the task of tagging instances with small subsets of relevant labels coming from an extremely large set of all possible labels. Recently, XMLC has been widely applied to…
Extreme Multi-Label ClassificationMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONRecommendation SystemsEstimating Instance-dependent Bayes-label Transition Matrix using a Deep Neural Network
In label-noise learning, estimating the transition matrix is a hot topic as the matrix plays an important role in building statistically consistent classifiers. Traditionally, the transition from clean labels to noisy la…
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…
BenchmarkingClassificationHolistic Label Correction for Noisy Multi-Label Classification
Multi-label classification aims to learn classification models from instances associated with multiple labels. It is pivotal to learn and utilize the label dependence among multiple labels in multi-label classificati…
ClassificationMemorizationMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATION