Author
Abstract
In this chapter, we examine the twin support vector machine (TWSVM) for binary data classification, a model originally introduced by Jayadeva et al. (IEEE Trans Pattern Anal Mach Intell 29(5):905–910, 2007). TWSVM builds on the generalized eigenvalue proximal support vector machine (GEPSVM) developed by Mangasarian et al. (IEEE Trans Pattern Anal Mach Intell 28(1):69–74, 2006). Both TWSVM and GEPSVM aim to separate data classes using two nonparallel hyperplanes, with each hyperplane positioned closer to one class while remaining farther from the other. However, their approaches differ significantly: GEPSVM relies on eigenvectors derived from generalized eigenvalue problems, while TWSVM adheres more closely to the traditional support vector machine (SVM) framework by solving two smaller quadratic programming problems (QPPs) instead of one large one, resulting in improved computational efficiency. Shao et al. (IEEE Trans Neural Netw 22(6):962–968, 1998) later introduced an enhanced version of TWSVM, called twin bounded support vector machines (TBSVMs). The primary advantage of TBSVM over TWSVM is its inclusion of structural risk minimization by adding a regularization term. Rooted in statistical learning theory, this modification enhances classification performance. Another TWSVM variant, the least squares twin support vector machine (LS-TSVM), was proposed by Kumar and Gopal (Expert Syst Appl 36(4):7535–7543, 2009). This model addresses some TWSVM limitations by solving two sets of linear equations to directly obtain two nonparallel planes. However, LS-TSVM applies the principle of empirical risk minimization rather than structural risk minimization, focusing solely on minimizing training error, which can increase susceptibility to overfitting. To address this, Xu et al. (J Inf Comput Sci 9(4):1063–1071, 2012) proposed an improved LS-TSVM version, enhancing classifier accuracy. In this chapter, we will explore various optimization techniques for twin support vector machines in the primal space.
Suggested Citation
Hossein Moosaei & Fatemeh Bazikar & Milan Hladík, 2025.
"Optimization Techniques for Twin Support Vector Machines in Primal Space,"
Springer Optimization and Its Applications, in: Boris Goldengorin (ed.), Theory, Algorithms, and Experiments in Applied Optimization, pages 241-259,
Springer.
Handle:
RePEc:spr:spochp:978-3-031-91357-0_12
DOI: 10.1007/978-3-031-91357-0_12
Download full text from publisher
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below whether another version of this item is available online.
2. Check on the provider's
web page
whether it is in fact available.
3. Perform a
for a similarly titled item that would be
available.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-031-91357-0_12. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.