dc.contributor.authors |
Erdem, Z; Polikar, R; Gurgen, F; Yumusak, N; |
|
dc.date.accessioned |
2020-01-13T07:57:03Z |
|
dc.date.available |
2020-01-13T07:57:03Z |
|
dc.date.issued |
2005 |
|
dc.identifier.citation |
Erdem, Z; Polikar, R; Gurgen, F; Yumusak, N; (2005). Lecture Notes in Computer Science. MULTIPLE CLASSIFIER SYSTEMS, 3541, 256-246 |
|
dc.identifier.isbn |
3-540-26306-3 |
|
dc.identifier.issn |
0302-9743 |
|
dc.identifier.uri |
https://hdl.handle.net/20.500.12619/2516 |
|
dc.description.abstract |
Support Vector Machines (SVMs) have been successfully applied to solve a large number of classification and regression problems. However, SVMs suffer from the catastrophic forgetting phenomenon, which results in loss of previously learned information. Learn(++) have recently been introduced as an incremental learning algorithm. The strength of Learn(++) lies in its ability to learn new data without forgetting previously acquired knowledge and without requiring access to any of the previously seen data, even when the new data introduce new classes. To address the catastrophic forgetting problem and to add the incremental learning capability to SVMs, we propose using an ensemble of SVMs trained with Learn(++). Simulation results on real-world and benchmark datasets suggest that the proposed approach is promising. |
|
dc.language |
English |
|
dc.publisher |
SPRINGER-VERLAG BERLIN |
|
dc.subject |
Computer Science |
|
dc.title |
Lecture Notes in Computer Science |
|
dc.type |
Proceedings Paper |
|
dc.identifier.volume |
3541 |
|
dc.identifier.startpage |
246 |
|
dc.identifier.endpage |
256 |
|
dc.contributor.department |
Sakarya Üniversitesi/Bilgisayar Ve Bilişim Bilimleri Fakültesi/Bilgisayar Mühendisliği Bölümü |
|
dc.contributor.saüauthor |
Yumuşak, Nejat |
|
dc.relation.journal |
MULTIPLE CLASSIFIER SYSTEMS |
|
dc.identifier.wos |
WOS:000230171500025 |
|
dc.contributor.author |
Yumuşak, Nejat |
|