2001
DOI: 10.1016/s0362-546x(01)00664-2
|View full text |Cite
|
Sign up to set email alerts
|

Support vector learning with quadratic programming and adaptive step size barrier-projection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2012
2012

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…SVMs were first suggested for classification by Vapnik circa 1960s and have recently become an area of intense research, owing to developments in theory and practical techniques, combined with extensions to regression and density estimation (Drucker, Wu, & Vapnik, 1999;Fan & Palaniswami, 2000;To, Lim, Teo, & Liebelt, 2001;Vapnik, 1998). SVMs were motivated by statistical learning theory; the aim was to solve only the given problem, without solving a more difficult problem as an intermediate step.…”
Section: Svmsmentioning
confidence: 99%
“…SVMs were first suggested for classification by Vapnik circa 1960s and have recently become an area of intense research, owing to developments in theory and practical techniques, combined with extensions to regression and density estimation (Drucker, Wu, & Vapnik, 1999;Fan & Palaniswami, 2000;To, Lim, Teo, & Liebelt, 2001;Vapnik, 1998). SVMs were motivated by statistical learning theory; the aim was to solve only the given problem, without solving a more difficult problem as an intermediate step.…”
Section: Svmsmentioning
confidence: 99%