Pages that link to "Item:Q5959961"

The following pages link to Linear programming boosting via column generation (Q5959961):

Displaying 36 items.

• A multi-kernel support tensor machine for classification with multitype multiway data and an application to cross-selling recommendations (Q323495) (← links)
• Supervised classification and mathematical optimization (Q339559) (← links)
• Training effective node classifiers for cascade classification (Q361264) (← links)
• Learning with infinitely many features (Q374174) (← links)
• Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
• Exploring the trade-off between generalization and empirical errors in a one-norm SVM (Q439563) (← links)
• Further results on the margin explanation of boosting: new algorithm and experiments (Q439827) (← links)
• Analysis of programming properties and the row-column generation method for 1-norm support vector machines (Q460673) (← links)
• Fully corrective boosting with arbitrary loss and regularization (Q460675) (← links)
• Relational linear programming (Q511779) (← links)
• Multi-pattern generation framework for logical analysis of data (Q513641) (← links)
• A new column generation algorithm for logical analysis of data (Q646710) (← links)
• Mathematical optimization in classification and regression trees (Q828748) (← links)
• Reduced analytic dependency modeling: robust fusion for visual recognition (Q901804) (← links)
• PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
• DOOMRED: a new optimization technique for boosted cascade detectors on enforced training set (Q966593) (← links)
• Finding the best not the most: regularized loss minimization subgraph selection for graph classification (Q1669622) (← links)
• A new maximum margin algorithm for one-class problems and its boosting implementation (Q1779737) (← links)
• On the sparseness of 1-norm support vector machines (Q1784565) (← links)
• Reconstruction of transcription-translation dynamics with a model of gene networks (Q1798284) (← links)
• gBoost: a mathematical programming approach to graph classification and regression (Q1959643) (← links)
• Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
• A simple method for convex optimization in the oracle model (Q2164690) (← links)
• Structured learning of binary codes with column generation for optimizing ranking measures (Q2193865) (← links)
• A weighted multiple classifier framework based on random projection (Q2214960) (← links)
• Fast greedy \(\mathcal{C} \)-bound minimization with guarantees (Q2217455) (← links)
• A hierarchical multiple kernel support vector machine for customer churn prediction using longitudinal behavioral data (Q2253363) (← links)
• Multi-group support vector machines with measurement costs: A biobjective approach (Q2478436) (← links)
• An Improved Branch-and-Bound Method for Maximum Monomial Agreement (Q2815448) (← links)
• FEATURE SELECTION VIA LEAST SQUARES SUPPORT FEATURE MACHINE (Q3503116) (← links)
• Improving random forest algorithm by Lasso method (Q5033957) (← links)
• Theory and Algorithms for Shapelet-Based Multiple-Instance Learning (Q5131159) (← links)
• Online Learning with (Multiple) Kernels: A Review (Q5327183) (← links)
• Robust Loss Functions for Boosting (Q5440967) (← links)
• The synergy between PAV and AdaBoost (Q5896776) (← links)
• The synergy between PAV and AdaBoost (Q5920546) (← links)