Selective support vector machines

Onur Seref (), O. Erhun Kundakcioglu, Oleg A. Prokopyev and Panos M. Pardalos
Additional contact information
Onur Seref: Virginia Polytechnic Institute and State University
O. Erhun Kundakcioglu: University of Florida
Oleg A. Prokopyev: University of Pittsburgh
Panos M. Pardalos: University of Florida

Journal of Combinatorial Optimization, 2009, vol. 17, issue 1, No 2, 3-20

Abstract: Abstract In this study we introduce a generalized support vector classification problem: Let X i , i=1,…,n be mutually exclusive sets of pattern vectors such that all pattern vectors x i,k , k=1,…,|X i | have the same class label y i . Select only one pattern vector $x_{i,k^{*}}$ from each set X i such that the margin between the set of selected positive and negative pattern vectors are maximized. This problem is formulated as a quadratic mixed 0-1 programming problem, which is a generalization of the standard support vector classifiers. The quadratic mixed 0-1 formulation is shown to be $\mathcal{NP}$ -hard. An alternative approach is proposed with the free slack concept. Primal and dual formulations are introduced for linear and nonlinear classification. These formulations provide flexibility to the separating hyperplane to identify the pattern vectors with large margin. Iterative elimination and direct selection methods are developed to select such pattern vectors using the alternative formulations. These methods are compared with a naïve method on simulated data. The iterative elimination method is also applied to neural data from a visuomotor categorical discrimination task to classify highly cognitive brain activities.

Keywords: Classification; Support vector machines; Quadratic mixed 0-1 programming (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9189-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:17:y:2009:i:1:d:10.1007_s10878-008-9189-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-008-9189-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().