2008
DOI: 10.1016/j.neucom.2007.11.023
|View full text |Cite
|
Sign up to set email alerts
|

Kernel-based online machine learning and support vector reduction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 60 publications
(30 citation statements)
references
References 4 publications
0
26
0
Order By: Relevance
“…Lagrangian multipliers ( i α ) can be found out by solving following quadratic programming problem [33][34][35][36][37] …”
Section: Modeling Tool -Support Vector Machinementioning
confidence: 99%
“…Lagrangian multipliers ( i α ) can be found out by solving following quadratic programming problem [33][34][35][36][37] …”
Section: Modeling Tool -Support Vector Machinementioning
confidence: 99%
“…The hardware-friendly SVM, aiming to implement the SVM on an embedded system, includes hardware-based online learning [40], feedforward SVM without multipliers using Laplacian kernel [41], and SVM with integer parameters [42]. This paper categorizes SVNR methods into five approaches by incorporating categories of previous works [29]- [32], [86] and analyzing them from the viewpoint of an application engineer. First, SVNR methods are divided into either prepruning or postpruning as in [29] according to whether they exploit the result of a standard SVM.…”
Section: B Position and Taxonomy Of Svnrmentioning
confidence: 99%
“…The methods in [25], [32], [33], and [65]- [69] search for a subset of the original SV set minimizing the approximation error. The method in [65] starts from an empty set and iteratively adds an SV that is expected to make the largest decrease in the approximation error.…”
Section: F Reduced-set Selection Of Postpruningmentioning
confidence: 99%
See 2 more Smart Citations