2018
DOI: 10.1016/j.engappai.2018.08.003
|View full text |Cite
|
Sign up to set email alerts
|

A novel projection nonparallel support vector machine for pattern classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 40 publications
0
7
0
Order By: Relevance
“…However, SVM classifiers can fulfil this objective, perfectly. The SVM finds an optimal separating hyperplane by maximising the margin between the separating hyperplane and the data [26, 27]. Three multi‐class classification problems, namely SVM 1 , SVM 2 , and SVM 3 are defined and solved to determine the type, location, and severity of the internal faults, respectively.…”
Section: Principles Of the Proposed Hybrid Techniquementioning
confidence: 99%
“…However, SVM classifiers can fulfil this objective, perfectly. The SVM finds an optimal separating hyperplane by maximising the margin between the separating hyperplane and the data [26, 27]. Three multi‐class classification problems, namely SVM 1 , SVM 2 , and SVM 3 are defined and solved to determine the type, location, and severity of the internal faults, respectively.…”
Section: Principles Of the Proposed Hybrid Techniquementioning
confidence: 99%
“…Compared with the classical SVM, the nonparallel SVM models (GEPSVM and TWSVM) have lower computational complexity and better generalization ability. Therefore, in the last few years, they have been studied extensively and developed rapidly, including a least squares version of TWSVM (LSTSVM) [16], structural risk minimization version of TWSVM (TBSVM) [17], ν-PTSVM [18], nonparallel SVM (NPSVM) [19,20], nonparallel projection SVM (NPrSVM) [21], and so on [21][22][23][24][25][26][27][28].…”
Section: Introductionmentioning
confidence: 99%
“…From then on, various improved algorithms based on PTSVM are proposed [24]- [34], e.g. RPTSVM [24], LSPTSVM [25], [26], IPTSVM [27], LIWLSPTSVM [28], PNPSVM [29], NPTSVM [30], PTSVR [31] and other variants PTSVM algorithms [32]- [34]. Although LSTSVM has been presented by using the squared loss function instead of hinge loss function in TWSVM and obtains very fast training speed since two QPPs are replaced by two systems of linear equations, but may result in the reduction of classification ability and the characteristic of constructing two nonparallel hyperplanes may be weakened [35].…”
Section: Introductionmentioning
confidence: 99%