Bennett, K. and Mangasarian, O. (1992). Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Research Reports on Mathematical and Computing Sciences - Series Operations Research (Correct)
....or criteria for choosing appropriate D. In this paper, we provide a way to choose D under a certain criterion that is derived naturally based on the geometrical interpretation of D given by Bennett and Bredensteiner [BB00] which is in fact similar to the one proposed by Bennett and Mangasarian [BM92]. The training problem for two class classification SVM can be phrased as follows . Suppose that we are given a set of m examples x i , 1 m, in some n dimension space, say IR . Each example x i is labeled by y i # 1, 1 denoting the classification of the example. The goal of SVM ....
....two reduced convex hulls are linearly separable under the current choice of D. In the field of linear classification with linear programming, the idea that consider linear separability of the reduced convex hulls of positive and negative exmaples has already proposed by Bennet and Mangasarian [BM92], and they has experimented to confirm its validity. The technical contribution of this paper is to provide a mathematical analysis for using the same criteria in the context of support vector machines. 2 When Two Reduced Convex Hulls Are Linearly Separable The technical contribution of this ....
[Article contains additional citation context not shown here]
K.P. Bennett and O.L. Mangasarian, Robust linear programming discrimination of two linearly inseparable sets, Optimization Methods and Software 1, 23-34, 1992.
Clustering via Concave Minimization - Bradley And Mangasarian (1997) (7 citations) Self-citation (Mangasarian) (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34, 1992.
The Berlin Brain-Computer Interface: Machine Learning .. - Blankertz, Dornhege, .. (2006) (Correct)
No context found.
Bennett, K. and Mangasarian, O. (1992). Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34.
Ecient Optimal Linear Boosting of A Pair of Classifiers - Victor Boyarshinov Dept (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, pages 23--34, 1992.
Ecient Optimal Linear Boosting of A Pair of Classifiers - Victor Boyarshinov Dept (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, pages 23--34, 1992.
Fault-Threshold Prediction with Linear Programming.. - Maurizio Pighin Department (2003) (Correct)
No context found.
Mangasarian, O. L., and Bennet, K. P. 1992. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1--24.
Computational Intelligence Methods for Rule-Based Data.. - Duch, Setiono, Zurada (2004) (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian, "Robust linear programming discrimination of two linearly inseparable sets," Optim. Methods Softw., vol. 1, pp. 23--34, 1992.
Inducing Safer Oblique Trees without Costs - Vadera (2005) (Correct)
No context found.
BENNETT, K.P. and O.L. MANGASARIAN (1992) Robust linear programming discrimination of two linearly inseparable sets, Optimization Methods and Software, 1, 23--34.
An Evaluation of TRACA's Generalisation Performance - Matthew Mitchell School (2002) (Correct)
No context found.
Bennett, K. and O. Mangasarian (1992). Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software 1, 23--34.
Barrier Boosting - Rätsch, Warmuth, Mika, Onoda, Müller (2000) (Correct)
No context found.
K.P. Bennett and O.L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34, 1992.
Subspace Information Criterion for Sparse Regressors - Tsuda, Sugiyama, Müller (2001) (Correct)
No context found.
K.P. Bennett and O.L. Mangasarian, "Robust linear programming discrimination of two linearly inseparable sets," Optimization Methods and Software, vol. 1, pp. 23--34, 1992.
Unsupervised and Supervised Data Classification.. - Bagirov, Rubinov, .. (Correct)
No context found.
K.P. Bennett and O.L. Mangasarian, Robust linear programming discrimination of two linearly inseparable sets, Optimization Methods and Software, 1, 1992, 23-34.
Subspace Information Criterion for Non-Quadratic.. - Tsuda, Sugiyama, Müller (2002) (Correct)
No context found.
K.P. Bennett and O.L. Mangasarian, "Robust linear programming discrimination of two linearly inseparable sets," Optimization Methods and Software, vol. 1, pp. 23--34, 1992.
Barrier Boosting - Rätsch, Warmuth, Mika, Onoda, Lemm.. (Correct)
No context found.
K.P. Bennett and O.L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34, 1992.
Multiobjective Parsimony Enforcement for Superior.. - Bernstein, Li.. (2004) (1 citation) (Correct)
No context found.
Bennett, K. P. and Mangasarian, O. L.: Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, (1):23--34, (1992)
CS 635 Project - Spring Semester Glenn (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34, 1992.
Support Vector Machines for Linear Programming: - Motivation And Formulations (Correct)
No context found.
Kristin P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23-34, 1992.
Classification in a Normalized Feature Space Using Support.. - Graf, Smola, Borer (2003) (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian, "Robust linear programming discrimination of two linearly inseparable sets," Optimization Methods and Software, vol. 1, pp. 23--34, 1992.
Bayesian Kernel Methods - Smola, Schölkopf (2003) (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34, 1992.
Online Learning with Kernels - Kivinen, Smola, Williamson (2002) (5 citations) (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian, "Robust linear programming discrimination of two linearly inseparable sets," Optimization Methods and Software, vol. 1, pp. 23--34, 1992.
On the Approximability of Some NP-hard Minimization Problems.. - Amaldi, Kann (1996) (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34, 1992.
Computational Intelligence Methods for Rule-Based Data.. - Duch, Setiono, Zurada (2004) (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian, "Robust linear programming discrimination of two linearly inseparable sets," Optim. Methods Softw., vol. 1, pp. 23--34, 1992.
Online Learning with Kernels - Kivinen, Smola, Williamson (2002) (5 citations) (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34, 1992.
Subspace Information Criterion for Non-Quadratic.. - Tsuda, Sugiyama, Müller (2002) (Correct)
No context found.
K.P. Bennett and O.L. Mangasarian, "Robust linear programming discrimination of two linearly inseparable sets," Optimization Methods and Software, vol. 1, pp. 23--34, 1992.
Simultaneous Feature Selection and Classifier Training via.. - Guo, Dyer (2003) (Correct)
No context found.
K. P. Bennett and O. L. Mangasarian, "Robust linear programming discrimination of two linearly inseparable sets," Optimization Methods and Software, vol. 1, 23-34, 1992.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC