See this document in CiteSeerX!

Robust Linear Programming Discrimination Of Two Linearly Inseparable Sets (1992)  (Make Corrections)  (124 citations)
Kristin P. Bennett, O. L. Mangasarian



  Home/Search   Context   Related

 
View or download:
wisc.edu/techreports/repo...tr1054a.ps
wisc.edu/techreports/repo...tr1054a.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  svm.first.gmd.de/publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: INTRODUCTION We consider the two point-sets A and B in the n-dimensional real space R n represented by the m \Theta n matrix A and the k \Theta n matrix B respectively. Our principal objective here is to formulate a single linear program with the following properties: (i) If the convex hulls of A and B are disjoint, a strictly separating plane is obtained. (ii) If the convex hulls of A and B intersect, a plane is obtained that minimizes some measure of misclassification points, for all... (Update)

Similar documents based on text:   More   All
0.4:   Duality, Geometry, and Support Vector Regression - Jinbo Bi And   (Correct)
0.2:   A Newton Method for Linear Programming - Mangasarian (2002)   (Correct)
0.2:   Duality and Geometry in SVM Classifiers - Bennett, Bredensteiner (2000)   (Correct)

BibTeX entry:   (Update)

K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23--34, 1992. http://citeseer.ist.psu.edu/bennett92robust.html   More

@techreport{ bennettrobust,
    author = "Kristin P. Bennett and Olvi L. Mangasarian",
    title = "Robust Linear Programming Discrimination of Two Linearly Inseparable Sets",
    number = "CS-TR-1991-1054a",
    url = "citeseer.ist.psu.edu/bennett92robust.html" }
Citations (may not include all citations):
686   Practical Methods in Optimization (context) - Fletcher - 1987
119   Nonlinear Programming (context) - Mangasarian - 1969
73   Introduction to Optimization (context) - Polyak - 1987
46   Pattern Recognition via Linear Programming: Theory and Appli.. - Mangasarian, Setiono et al. - 1990
37   Neural Network Training Via Linear Programming (context) - Bennett, Mangasarian - 1992
35   Linear and Nonlinear Separation of Patterns by Linear Progra.. (context) - Mangasarian - 1965
32   International Application of a New Probability Algorithm for.. (context) - Detrano, Janosi et al. - 1989
20   Multisurface Method of Pattern Separation (context) - Mangasarian - 1968
14   Improved Linear Programming Models for Discriminant Analysis (context) - Glover - 1990
9   Pattern Classifier Design by Linear Programming (context) - Smith - 1968
6   Diagnostic Schemes for Fine Needle Aspirates of Breast Masse.. (context) - Wolberg, Tanner et al. - 1988
5   Learning Internal Representations (context) - Rumelhart, Hinton et al. - 1969
2   Mathematical Programming Methods of Pattern Classification (context) - Grinold - 1972
1   Multisurface Method of Pattern Separation Applied to Breast .. (context) - Wolberg, Mangasarian - 1990



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://svm.first.gmd.de/publications.html):   More
Dynamically Adapting Kernels in Support Vector Machines - Cristianini, Campbell.. (1998)   (Correct)
Generalization Bounds and Learning Rates for.. - Smola, Williamson.. (1998)   (Correct)
Multiplicative Updatings for Support-Vector Learning - Cristianini, Campbell.. (1998)   (Correct)

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