One-class classifiers with incremental learning and forgetting for data streams with concept drift

被引:0
作者
Bartosz Krawczyk
Michał Woźniak
机构
[1] Wrocław University of Technology,Department of Systems and Computer Networks
来源
Soft Computing | 2015年 / 19卷
关键词
Pattern classification; One-class classification; Data stream classification; Concept drift; Incremental learning; Forgetting;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:3387 / 3400
页数:13
相关论文
共 77 条
[1]  
Aha DW(1991)Instance-based learning algorithms Mach Learn 6 37-66
[2]  
Kibler D(2009)Soft clustering using weighted one-class support vector machines Pattern Recognit 42 27-32
[3]  
Albert MK(2012)One-class support vector ensembles for image segmentation and classification J Math Imaging Vision 42 103-117
[4]  
Bicego M(2003)A general framework for mining massive data streams J Comput Graph Stat 12 945-949
[5]  
Figueiredo MAT(2003)Online ensemble learning: an empirical study Mach Learn 53 71-109
[6]  
Cyganek B(2012)A survey on learning from data streams: current and future trends Prog AI 1 45-55
[7]  
Domingos P(2012)An empirical study of learning and forgetting constraints AI Commun 25 191-208
[8]  
Hulten G(2011)Adaptive one-class support vector machine IEEE Trans Signal Process 59 2975-2981
[9]  
Fern A(2009)Adapted one-versus-all decision trees for data stream classification IEEE Trans Knowl Data Eng 21 624-637
[10]  
Givan R(1991)Adaptive mixtures of local experts Neural Comput 3 79-87