Linear programming boosting via column generation
From MaRDI portal
Publication:5959961
DOI10.1023/A:1012470815092zbMath0998.68105OpenAlexW1578080815MaRDI QIDQ5959961
Ayhan Demiriz, John Shawe-Taylor, Kristin P. Bennett
Publication date: 11 April 2002
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1012470815092
Related Items (36)
Improving random forest algorithm by Lasso method ⋮ Mathematical optimization in classification and regression trees ⋮ A multi-kernel support tensor machine for classification with multitype multiway data and an application to cross-selling recommendations ⋮ Supervised classification and mathematical optimization ⋮ A simple method for convex optimization in the oracle model ⋮ Training effective node classifiers for cascade classification ⋮ Finding the best not the most: regularized loss minimization subgraph selection for graph classification ⋮ Online Learning with (Multiple) Kernels: A Review ⋮ Learning with infinitely many features ⋮ FEATURE SELECTION VIA LEAST SQUARES SUPPORT FEATURE MACHINE ⋮ Structured learning of binary codes with column generation for optimizing ranking measures ⋮ Reduced analytic dependency modeling: robust fusion for visual recognition ⋮ PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ Sparse weighted voting classifier selection and its linear programming relaxations ⋮ Exploring the trade-off between generalization and empirical errors in a one-norm SVM ⋮ Further results on the margin explanation of boosting: new algorithm and experiments ⋮ A new column generation algorithm for logical analysis of data ⋮ gBoost: a mathematical programming approach to graph classification and regression ⋮ A weighted multiple classifier framework based on random projection ⋮ Theory and Algorithms for Shapelet-Based Multiple-Instance Learning ⋮ Analysis of programming properties and the row-column generation method for 1-norm support vector machines ⋮ Fully corrective boosting with arbitrary loss and regularization ⋮ Fast greedy \(\mathcal{C} \)-bound minimization with guarantees ⋮ The synergy between PAV and AdaBoost ⋮ Relational linear programming ⋮ Multi-pattern generation framework for logical analysis of data ⋮ Multi-group support vector machines with measurement costs: A biobjective approach ⋮ A hierarchical multiple kernel support vector machine for customer churn prediction using longitudinal behavioral data ⋮ DOOMRED: a new optimization technique for boosted cascade detectors on enforced training set ⋮ The synergy between PAV and AdaBoost ⋮ A new maximum margin algorithm for one-class problems and its boosting implementation ⋮ Robust Loss Functions for Boosting ⋮ On the sparseness of 1-norm support vector machines ⋮ Reconstruction of transcription-translation dynamics with a model of gene networks ⋮ An Improved Branch-and-Bound Method for Maximum Monomial Agreement ⋮ Multilinear sets with two monomials and cardinality constraints
This page was built for publication: Linear programming boosting via column generation
