One-class classifiers with incremental learning and forgetting for data streams with concept drift
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605469326 | ||
| 003 | CHVBK | ||
| 005 | 20210128100321.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151201xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1492-5 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1492-5 | ||
| 245 | 0 | 0 | |a One-class classifiers with incremental learning and forgetting for data streams with concept drift |h [Elektronische Daten] |c [Bartosz Krawczyk, Michał Woźniak] |
| 520 | 3 | |a One of the most important challenges for machine learning community is to develop efficient classifiers which are able to cope with data streams, especially with the presence of the so-called concept drift. This phenomenon is responsible for the change of classification task characteristics, and poses a challenge for the learning model to adapt itself to the current state of the environment. So there is a strong belief that one-class classification is a promising research direction for data stream analysis—it can be used for binary classification without an access to counterexamples, decomposing a multi-class data stream, outlier detection or novel class recognition. This paper reports a novel modification of weighted one-class support vector machine, adapted to the non-stationary streaming data analysis. Our proposition can deal with the gradual concept drift, as the introduced one-class classifier model can adapt its decision boundary to new, incoming data and additionally employs a forgetting mechanism which boosts the ability of the classifier to follow the model changes. In this work, we propose several different strategies for incremental learning and forgetting, and additionally we evaluate them on the basis of several real data streams. Obtained results confirmed the usability of proposed classifier to the problem of data stream classification with the presence of concept drift. Additionally, implemented forgetting mechanism assures the limited memory consumption, because only quite new and valuable examples should be memorized. | |
| 540 | |a The Author(s), 2014 | ||
| 690 | 7 | |a Pattern classification |2 nationallicence | |
| 690 | 7 | |a One-class classification |2 nationallicence | |
| 690 | 7 | |a Data stream classification |2 nationallicence | |
| 690 | 7 | |a Concept drift |2 nationallicence | |
| 690 | 7 | |a Incremental learning |2 nationallicence | |
| 690 | 7 | |a Forgetting |2 nationallicence | |
| 700 | 1 | |a Krawczyk |D Bartosz |u Department of Systems and Computer Networks, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland |4 aut | |
| 700 | 1 | |a Woźniak |D Michał |u Department of Systems and Computer Networks, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/12(2015-12-01), 3387-3400 |x 1432-7643 |q 19:12<3387 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1492-5 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1492-5 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Krawczyk |D Bartosz |u Department of Systems and Computer Networks, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Woźniak |D Michał |u Department of Systems and Computer Networks, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/12(2015-12-01), 3387-3400 |x 1432-7643 |q 19:12<3387 |1 2015 |2 19 |o 500 | ||