Robust optimal classification trees under noisy labels

DOI10.1007/s11634-021-00467-2OpenAlexW3204654368MaRDI QIDQ2673362

Justo Puerto, A. Japón, Víctor Blanco

Publication date: 9 June 2022

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.08560

zbMATH Keywords

classificationhyperplanessupport vector machinesmulticlass classificationmixed integer non linear programmingoptimal classification trees

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Mixed integer programming (90C11) Learning and adaptive systems in artificial intelligence (68T05) Relations with arrangements of hyperplanes (32S22)

Related Items (2)

Margin optimal classification trees ⋮ Classification trees with mismeasured responses

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Mathematical optimization in classification and regression trees
• Lagrangian relaxation for SVM feature selection
• Locating hyperplanes to fitting set of points: a general framework
• Clustering data that are graph connected
• Support-vector networks
• On the multisource hyperplanes location problem to fitting set of points
• A cost-sensitive constrained Lasso
• Optimal decision trees for categorical data via integer programming
• A branch-and-price procedure for clustering data that are graph connected
• Optimal arrangements of hyperplanes for SVM-based multiclass classification
• Selection of time instants and intervals with support vector regression for multivariate functional data
• Nearest neighbor pattern classification
• Optimal classification trees
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Robust optimal classification trees under noisy labels