2010
DOI: 10.1109/tnn.2010.2048039
|View full text |Cite
|
Sign up to set email alerts
|

Multiple Incremental Decremental Learning of Support Vector Machines

Abstract: We propose a multiple incremental decremental algorithm of support vector machines (SVM). In online learning, we need to update the trained model when some new observations arrive and/or some observations become obsolete. If we want to add or remove single data point, conventional single incremental decremental algorithm can be used to update the model efficiently. However, to add and/or remove multiple data points, the computational cost of current update algorithm becomes inhibitive because we need to repeat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
75
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 110 publications
(75 citation statements)
references
References 16 publications
0
75
0
Order By: Relevance
“…On the other hand, the incremental classifier methods target on updating the prediction boundary with the learned model parameters and new samples. Exemplars include the incremental support vector machines (ISVM) [24] and the online sequential forward neural network [25]. In addition, several attempts have been made to absorb advantages from both of the two categories of methods.…”
Section: Related Workmentioning
confidence: 99%
“…On the other hand, the incremental classifier methods target on updating the prediction boundary with the learned model parameters and new samples. Exemplars include the incremental support vector machines (ISVM) [24] and the online sequential forward neural network [25]. In addition, several attempts have been made to absorb advantages from both of the two categories of methods.…”
Section: Related Workmentioning
confidence: 99%
“…The regularization parameter C balances the importance of error and margin [9]. In practice, the dual problem of (4) is solved to obtain a SVM classifier [10], [11].…”
Section: Preliminary Knowledgementioning
confidence: 99%
“…The regularization parameter C balances the importance of error and margin (Yamasaki & Ikeda, 2005). In practice, the dual problem of (6) is solved to obtain a SVM classifier (Cauwenberghs & Poggio, 2000;Karasuyama & Takeuchi, 2010). LPSVM (Fung & Mangasarian, 2001b) models a binary classification as a regularized least square problem, which simplifies the above SVM optimization and results in an extremely efficient training algorithm.…”
Section: Batch Lpsvmmentioning
confidence: 99%