Incremental support vector machine learning: A local approach

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we propose and study a new on-line algorithm for learning a SVM based on Radial Basis Function Kernel: Local Incremental Learning of SVM or LISVM. Our method exploits the “locality” of RBF kernels to update current machine by only considering a subset of support candidates in the neighbourhood of the input. The determination of this subset is conditioned by the computation of the variation of the error estimate. Implementation is based on the SMO one, introduced and developed by Platt [13]. We study the behaviour of the algorithm during learning when using different generalization error estimates. Experiments on three data sets (batch problems transformed into on-line ones) have been conducted and analyzed.

Original languageEnglish
Title of host publicationArtificial Neural Networks - ICANN 2001 - International Conference, Proceedings
EditorsKurt Hornik, Georg Dorffner, Horst Bischof
PublisherSpringer Verlag
Pages322-330
Number of pages9
ISBN (Print)3540424865, 9783540446682
DOIs
Publication statusPublished - 1 Jan 2001
Externally publishedYes
EventInternational Conference on Artificial Neural Networks, ICANN 2001 - Vienna, Austria
Duration: 21 Aug 200125 Aug 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2130
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Artificial Neural Networks, ICANN 2001
Country/TerritoryAustria
CityVienna
Period21/08/0125/08/01

Fingerprint

Dive into the research topics of 'Incremental support vector machine learning: A local approach'. Together they form a unique fingerprint.

Cite this