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

Optical fiber intrusion signal unmixing by constrained quadratic programming approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…C is the penalty factor, balancing the maximum interval and the minimum number of misclassification points. Since formula (1) is a convex quadratic programming problem [18], solving the Lagrange multiplier can obtain the decision function…”
Section: Introduction To Svmsmentioning
confidence: 99%
“…C is the penalty factor, balancing the maximum interval and the minimum number of misclassification points. Since formula (1) is a convex quadratic programming problem [18], solving the Lagrange multiplier can obtain the decision function…”
Section: Introduction To Svmsmentioning
confidence: 99%
“…However, the SVM needs to settle the quadratic programming problem when looking for the separating hyperplane [11], and it is easily affected by the distribution of the support vector, hence the classification accuracy is greatly reduced in the case of a heavily large amount of data. Due to the fact that the support vectors [5,[12][13][14][15] are usually located in the outer contour area of the sample set, related scholars proposed the convex hull algorithm [16][17][18] to quickly obtain the support vectors.…”
Section: Introductionmentioning
confidence: 99%