On the public citation graph

Robust optimal classification trees under noisy labels

https://doi.org/10.1007/s11634-021-00467-2
0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-387-21606-5openalex-snapshot
The Elements of Statistical Learning
inferredcites →https://doi.org/10.1007/978-0-387-21606-5_1openalex-snapshot
Introduction
inferredcites →https://doi.org/10.1007/bf00994018openalex-snapshot
Support-Vector Networks
inferredcites →https://doi.org/10.1007/bfb0026666openalex-snapshot
Naive (Bayes) at forty: The independence assumption in information retrieval
inferredcites →https://doi.org/10.1007/s10898-021-01009-yopenalex-snapshot
Optimal decision trees for categorical data via integer programming
inferredcites →https://doi.org/10.1007/s10994-017-5633-9openalex-snapshot
Optimal classification trees
inferredcites →https://doi.org/10.1007/s11634-019-00367-6openalex-snapshot
Optimal arrangements of hyperplanes for SVM-based multiclass classification
inferredcites →https://doi.org/10.1007/s11634-020-00389-5openalex-snapshot
A cost-sensitive constrained Lasso
inferredcites →https://doi.org/10.1007/s11750-021-00594-1openalex-snapshot
Mathematical optimization in classification and regression trees
inferredcites →https://doi.org/10.1016/j.cor.2017.06.001openalex-snapshot
Lagrangian relaxation for SVM feature selection
inferredcites →https://doi.org/10.1016/j.cor.2018.03.009openalex-snapshot
Locating hyperplanes to fitting set of points: A general framework
inferredcites →https://doi.org/10.1016/j.cor.2020.105050openalex-snapshot
Selection of time instants and intervals with Support Vector Regression for multivariate functional data
inferredcites →https://doi.org/10.1016/j.cor.2020.105124openalex-snapshot
On the multisource hyperplanes location problem to fitting set of points
inferredcites →https://doi.org/10.1016/j.ejor.2017.02.009openalex-snapshot
Clustering data that are graph connected
inferredcites →https://doi.org/10.1016/j.ejor.2021.05.043openalex-snapshot
A branch-and-price procedure for clustering data that are graph connected
inferredcites →https://doi.org/10.1016/j.eswa.2009.02.037openalex-snapshot
A review of machine learning approaches to Spam filtering
inferredcites →https://doi.org/10.1016/j.knosys.2008.01.001openalex-snapshot
A comparative study for content-based dynamic spam classification using four machine learning algorithms
inferredcites →https://doi.org/10.1016/j.patcog.2019.106985openalex-snapshot
Support vector machines resilient against training data integrity attacks
inferredcites →https://doi.org/10.1016/j.patrec.2018.06.034openalex-snapshot
Improving multiclass classification by deep networks using DAGSVM and Triplet Loss
inferredcites →https://doi.org/10.1016/s0925-2312(97)90018-7openalex-snapshot
Advances in neural information processing systems 7
inferredcites →https://doi.org/10.1049/el.2015.4437openalex-snapshot
Multi‐class classification using kernel density estimation on K ‐nearest neighbours
inferredcites →https://doi.org/10.1109/ijcnn.1998.687237openalex-snapshot
A support vector machine approach to decision trees
inferredcites →https://doi.org/10.1109/tit.1967.1053964openalex-snapshot
Nearest neighbor pattern classification
inferredcites →https://doi.org/10.1109/tnnls.2013.2292894openalex-snapshot
Classification in the Presence of Label Noise: A Survey
inferredcites →https://doi.org/10.2307/2288003openalex-snapshot
Classification and Regression Trees.
inferredcites →https://doi.org/10.2307/2530946openalex-snapshot
Classification and Regression Trees.
inferredcites →https://doi.org/10.48550/arxiv.1612.03225openalex-snapshot
Optimal Generalized Decision Trees via Integer Programming
inferredcites →https://doi.org/10.48550/arxiv.2004.10170openalex-snapshot
A Mathematical Programming approach to Binary Supervised Classification with Label Noise

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4341527openalex-extracted
Margin Optimal Classification Trees
inferred← citeshttps://doi.org/10.1007/s00357-023-09430-6openalex-snapshot
Classification Trees with Mismeasured Responses
inferred← citeshttps://doi.org/10.1007/s10589-026-00779-zopenalex-snapshot
A unified optimization framework for multiclass classification with structured hyperplane arrangements
inferred← citeshttps://doi.org/10.1007/s10589-026-00799-9openalex-snapshot
Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification
inferred← citeshttps://doi.org/10.1007/s10994-023-06366-1openalex-snapshot
Multiclass optimal classification trees with SVM-splits
inferred← citeshttps://doi.org/10.1007/s10994-024-06598-9openalex-snapshot
A class sensitivity feature guided T-type generative model for noisy label classification
inferred← citeshttps://doi.org/10.1016/j.cie.2022.108611openalex-snapshot
A mathematical programming approach to SVM-based classification with label noise
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106441openalex-snapshot
Margin optimal classification trees
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106515openalex-snapshot
New optimization models for optimal classification trees
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106579openalex-snapshot
An improved column-generation-based matheuristic for learning classification trees
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121293openalex-snapshot
A Mathematical Programming Approach to Sparse Canonical Correlation Analysis
inferred← citeshttps://doi.org/10.1016/j.knosys.2026.115597openalex-snapshot
Decision tree enhancer (DTE): Improving decision trees with optimization
inferred← citeshttps://doi.org/10.1287/ijoc.2025.1475openalex-snapshot
Weighted Optimal Classification Forests
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.