Discrete support vector decision trees via tabu search

DOI10.1016/j.csda.2003.11.005zbMath1429.62261OpenAlexW2084147663MaRDI QIDQ957011

Carlo Vercellis, Carlotta Orsenigo

Publication date: 26 November 2008

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2003.11.005

zbMATH Keywords

classificationtabu searchdecision treessupport vector machines

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Supervised classification and mathematical optimization, Bayesian stopping rules for greedy randomized procedures, Applications of optimization heuristics to estimation and modelling problems, Accurately learning from few examples with a polyhedral classifier, Multicategory classification via discrete support vector machines, Combining discrete SVM and fixed cardinality warping distances for multivariate time series classification

Uses Software

• C4.5
• RSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing deviations from the group mean: A new linear programming approach for the two-group classification problem
• Misclassification minimization
• Enlarging the margins in perceptron decision trees
• Hybrid misclassification minimization
• Tabu Search—Part I
• Tabu Search—Part II
• Mathematical Programming in Neural Networks
• Linear and Nonlinear Separation of Patterns by Linear Programming
• A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms