Concept updating with support vector machines

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In many practical situations in inductive learning algorithms, it is often expected to further improve the generalization capability after the learning process has been completed if new data are available. One of the common approaches is to add training data to the learning algorithm and retrain it, but retraining for each new data point or data set can be very expensive. In view of the learning methods of human beings, it seems natural to build posterior learning results upon prior results. In this paper, we apply Support Vector Machine(SVM) to the concept updating procedure. If initial concept would be built up by inductive algorithm, then concept updated is the normal solution corresponding to the initial concept learned. It was shown that concept learned would not change if the new available data located in error-insensitive zone. Especially, concept initially learned and updated by SVR induces an incremental SVR approximately learning method for large scale data. We tested our method on toys data sets and 7 regression bench mark data set. It shown that generalization capacity after updating with SVR was improved according to FVU or MSE on the independent test set. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Liu, Y., & He, Q. (2005). Concept updating with support vector machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3739 LNCS, pp. 492–501). https://doi.org/10.1007/11563952_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free