Knowledge based proximal support vector machines
We propose a proximal version of the knowledge based support vector machine formulation, termed as knowledge based proximal support vector machines (KBPSVMs) in the sequel, for binary data classification. The KBPSVM classifier incorporates prior knowledge in the form of multiple polyhedral sets, and determines two parallel planes that are kept as distant from each other as possible. The proposed algorithm is simple and fast as no quadratic programming solver needs to be employed. Effectively, only the solution of a structured system of linear equations is needed.
Year of publication: |
2009
|
---|---|
Authors: | Khemchandani, Reshma ; Jayadeva ; Chandra, Suresh |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 195.2009, 3, p. 914-923
|
Publisher: |
Elsevier |
Keywords: | Quadratic programming Proximal support vector machines Pattern classification Knowledge based systems Polyhedral sets |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Learning the optimal kernel for Fisher discriminant analysis via second order cone programming
Khemchandani, Reshma, (2010)
-
Knowledge based proximal support vector machines
Khemchandani, Reshma, (2009)
-
Learning the optimal kernel for Fisher discriminant analysis via second order cone programming
Khemchandani, Reshma, (2010)
- More ...