\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Concept Drift Detection in Data Stream Mining: The Review of Contemporary Literature},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2017 2017-01-15 (revised: 4 Year 2017 15 January 2017)}
\def\TheID{\makeatother }
\def\TheDate{2017 2017-01-15}
\title{Concept Drift Detection in Data Stream Mining: The Review of Contemporary Literature}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{B.  Ramakrishna}

             \affil[1]{  JNTU}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 December 2016 Accepted: 3 January 2017 Published: 15 January 2017}

\maketitle


\begin{abstract}
        


Mining process such as classification, clustering of progressive or dynamic data is a critical objective of the information retrieval and knowledge discovery; in particular, it is more sensitive in data stream mining models due to the possibility of significant change in the type and dimensionality of the data over a period. The influence of these changes over the mining process termed as concept drift. The concept drift that depict often in streaming data causes unbalanced performance of the mining models adapted. Hence, it is obvious to boost the mining models to predict and analyse the concept drift to achieve the performance at par best. The contemporary literature evinced significant contributions to handle the concept drift, which fall in to supervised, unsupervised learning, and statistical assessment approaches. This manuscript contributes the detailed review of the contemporary concept-drift detection models depicted in recent literature. The contribution of the manuscript includes the nomenclature of the concept drift models and their impact of imbalanced data tuples.

\end{abstract}


\keywords{concept drift, change point, data stream mining, ensemble classifiers, class imbalance, misclassification, supervised and unsupervised learning}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
apid expansion of Information and Communication Technologies (ICT) has led to exponential growth in the volume of data generated. According to a survey from IDC, in the near future the quantum of data that is generated will run to trillions of gigabytes \hyperref[b0]{[1]}. It is imperative that there is need for robust tools and solutions for handling the huge volume of data generated from varied range of applications. Eventually the huge volumes of data that are generated demand more effective techniques of data management.\par
Data mining is one of the major process in the data management. Profoundly the data mining solutions are about initially gathering data and processing them in offline mode. Predictive models are usually trained on the basis of historical data provided as pair of data (input and output). The trained models are used for prediction of output for new unseen input data.\par
Streaming data can't be processed simultaneously due to the quantum of data that is generated regularly. It is highly complex to accommodate the data in to machine's main memory and the online processing of data is the only right method that could be adapted. Predictive models can be trained either in an incremental manner by continuous update or by ensuring retaining of the model using batches of data.\par
In the constantly changing environments, the data distribution might change over course of time and it could lead to conditions of concept drift \hyperref[b1]{[2]}, \hyperref[b2]{[3]}. Concept drift is the changes in the conditional distribution of varied output (for example, the target variable for the input features) despite of the input remaining unchanged.\par
A classic example of real concept drift is about the change in user level interests whilst following an online news stream. For instance, though the distribution of a news documents that are often relayed might remain the same, still the conditional distribution of interesting news documents for the user might undergo changes. The process of adaptive learning reflects upon the predictive models online while their operation might be responding to concept drifts.\par
Phenomenal developments have taken place in terms of concept drift and there were many drift-aware adaptive learning algorithms were developed. The scope of the problem being very wide and spans over varied topics, not much of comprehensive survey is envisaged. Though the concept is relatively new, still there was some kind of adaptive learning algorithms that were proposed earlier.\par
Considering the quantum of develop ments that has taken place in the subject of concept drift, this paper focus on comprehensive summary of research done for gaining insights in to concepts unification and terminology and also to survey of contemporary methodologies and techniques that are investigated in the past. 
\section[{II.}]{II.} 
\section[{The Problem Description a) Misclassification}]{The Problem Description a) Misclassification}\par
Profoundly, in the case of misclassification, the minority class is highly complex than the majority class. For instance, the spam class in the spam filters and the fraud class in a credit card application. Hence, misclassifying-class example is highly a costlier factors.\par
the facets of misclassification, as they presume only balanced class distribution. Training procedure with target of maximizing overall accuracy usually leads to higher levels of probability of induced classifier that predicts as the instance of majority class along with low It is imperative to envisage majority class has higher accuracy levels while the minority class has much lower accuracy amidst ranging between 0-10\% \hyperref[b3]{[4]}. Misclassification resulting because of imbalance due to classifiers like the decision trees \hyperref[b4]{[5]}, KNN (K-Nearest Neighbour) \hyperref[b5]{[6]}, \hyperref[b6]{[7]}, \hyperref[b7]{[8]}, Neural Networks \hyperref[b8]{[9]} and SVM \hyperref[b9]{[10]}, \hyperref[b10]{[11]} that were reviewed. Classifiers offer a balanced degree of predictive performance over all classes that are required.\par
Profoundly the percentage of minority class in a data set is used in the researches to detail the level of imbalance in the data \hyperref[b11]{[12]}, list of varied illustrations in every class \hyperref[b12]{[13]}, size ratio amidst of classes \hyperref[b13]{[14]}. Coefficient of variance is used in \hyperref[b14]{[15]} that are less straight forward. Detailing of imbalance status might not be a crucial issue in offline learning, but it becomes more significant for online learning as there is hardly any static data over the online scenarios.\par
It is very essential to have some automatic evaluation for detailing the updated imbalance degree and techniques that monitor the changes over the Misclassification status. The facets of changes in the misclassification are directly coherent to concept drift. 
\section[{b) Concept drift}]{b) Concept drift}\par
Concept drift could take place when the joint probability P 9 (x; y) changes \hyperref[b15]{[16]}, \hyperref[b16]{[17]}. Concept drift will manifest three fundamental forms of changes pertaining to three key variables in the Bayes' theorem \hyperref[b17]{[18]}. 
\section[{1) Drift by prior probability (a change in learnt decision boundary):}]{1) Drift by prior probability (a change in learnt decision boundary):}\par
The prior probability of circle class is reduced and the change can lead to misclassification. Identification of drift using the prior probability is simple and it is distance between two concepts that are estimated depending on the distance assessment methods like the Total Variation Distance and Hellinger Distance. 
\section[{2) Drift by condition (decision boundary change influenced by condition):}]{2) Drift by condition (decision boundary change influenced by condition):}\par
True decision boundary remains unaffected. In the earlier research, authors have claimed that such types of drift are result of incomplete representation of true distribution over the current data that profoundly needs supplement data information for the learning model \hyperref[b18]{[19]}.\par
The subset of covariate attributes will have conditional probability distribution over varied possible values of covariate attributes for every specific class.\par
Conditional drift is weighted sum of distances amidst every probability distributions from varied time period, wherein the weights are average probability of class amidst the time periods in sequence. 
\section[{3) Drift by posterior probability (a change influenced by the conflict of old and new decision boundary):}]{3) Drift by posterior probability (a change influenced by the conflict of old and new decision boundary):}\par
True boundary amidst classes varies post drift and the earlier learnt discrimination function does not apply the changes more. In a different dimension, it can be stated that the old function becomes completely or partially unfit and the learning models are required to adapt to new dimensions.\par
For every subset of covariate attributes, there is a probability distribution amidst the class labels for every combination of covariate values at every time period. Hence the posterior drift can be estimated as weighted sum of distances amidst the probability distributions wherein the weighted sum of such distances amid the probability distributions wherein the weights are average probability over two periods of specific value to an covariate attribute subset.\par
Posterior distribution changes signify the fundamental changes among the data generation function, which is classified as a true concept drift. The other two types relate to virtual concept drift \hyperref[b19]{[20]} that do not change the decision boundaries. In real-term conditions, one type of concept drift might appear with combination with other kind of concept drifts. 
\section[{III. Review of State of the art models}]{III. Review of State of the art models}\par
In this section, the contemporary models pertaining to concept drift detection of streaming data mining from the contemporary literature. Overall models that were reviewed in varied context and it is a join detection of concept drift and misclassification. Concept drift detection using incremental learning and concept drift detection based on statistical methods. 
\section[{a) Joint detection of Concept Drift and Misclassification}]{a) Joint detection of Concept Drift and Misclassification}\par
Few of the researches have made effort to address the joint problem of concept drift and misclassification, because of rising need from practical problems \hyperref[b20]{[21]}, \hyperref[b21]{[22]}.\par
Uncorrelated Bagging is one of the old algorithm that is built to ensemble classifiers that are trained over a more balanced set of data based on re sampling and overcome the concept drift passively by weighing the base classifier having discriminative power \hyperref[b22]{[23]}, \hyperref[b23]{[24]}, \hyperref[b24]{[25]}.\par
Selectively the recursive approaches like REA \hyperref[b25]{[26]} and SERA \hyperref[b26]{[27]} adapt same kind of ideas for Uncorrelated Bagging of developing an ensemble weighted classifiers but with a smarter level of oversampling technique. Learn ++NIE and the Learn++CDS are some of the contemporary algorithms that tackle misclassification based on oversampling technique SMOTE \hyperref[b12]{[13]} or sub-ensemble technique and the concept drift based on a dynamic weighting strategy \hyperref[b27]{[28]}.\par
HUWRS.IP \hyperref[b28]{[29]} develops HUWRS \hyperref[b29]{[30]} to handle the imbalanced data streams by focusing on instance propagation scheme that relies on Naïve Bayes classifier and it uses Hellinger distance as a major weighting measure for concept drift detection.\par
All such approached relate to chunk-based learning algorithms, and the core techniques work over a batch of data that is received at every step. It is very complex to develop a true online algorithm for concept drift due to the issues like measuring minority class statistics based on one illustration at a time \hyperref[b30]{[31]}.\par
In order to handle the misclassification and concept drift in the form of an online fashion, some of the methods were proposed in the recent past. DDM -OCI \hyperref[b31]{[32]} is among one of the contemporary algorithms that were proposed for detection of concept drift actively over the imbalanced data streams online. It tracks the reduction over the minority-class recall and upon observing any kind of significant drop, the drift shall be reported. The solution was very effective when minority-class recall is impacted by concept drift but when majority class might be adversely impacted.\par
LFR (Linear Four Rates) is the other approach proposed for improving the DDM-OCI that monitors four rates based on confusion matrix-wherein the minority class recall and the precision, majority-class recall and precision that is statistically-supported bounds towards any kind of drift detection \hyperref[b32]{[33]}. If any of the four rates if found exceeding the bound, the drift shall be confirmed. In PAUC (Prudential AUC) \hyperref[b33]{[34]}, \hyperref[b34]{[35]} the emphasis is on developing an overall performance measure for online scenarios, and used as concept drift indicator. But accessibility to the historical data is imperative for the system. DDM-OCI, PAUC and LFR are very active drift detectors that are designed for imbalanced data streams and they are independent over the classification algorithms. Such significant constraint of such models is reset of the learning process if concept drift is considered. It could be infeasible in terms of handling the mis classification.\par
In addition to the above set of approaches, perceptr on oriented algorithms like ESOS-ELM \hyperref[b35]{[36]}, RLSACP \hyperref[b36]{[37]} and ONN \hyperref[b37]{[38]} focus on the classification model for non-stationery environments in a passive manner and comprise mechanisms to address misclassification. RLSACP and ONN are some of the single model approaches comprising similar set of modelling and framework.\par
CID (Class Imbalance Detection) approach was proposed with a varied objective towards concept drift \hyperref[b38]{[39]}. For defining the imbalanced degree that is suitable for online learning, a real-time indicator was proposed which is based on time decayed class size, the size pertaining to every class in the data stream. It is updated incrementally at every time using the time decay factor that emphasizes current status of data and it weakens the effect of old data. Any kind of current imbalance status is reported and it provides information pertaining to which classes belong to minority and majority classes. 
\section[{b) Concept Drift Detection by Incremental learning}]{b) Concept Drift Detection by Incremental learning}\par
Incremental learning is a new dimension in which the concept drift is identified with. Many of the models that were proposed earlier focused on incremental learning wherein the historical models were considered for forming the ensembles. Following are some of the contemporary incremental learning models SEA (Streaming Ensemble Algorithm) \hyperref[b39]{[40]} uses simple majority voting, the DIC (Dynamic Integration of Classifiers) approach \hyperref[b40]{[41]} combines historical models with novel model of data training using the dynamic selection (DS), DVS (Dynamic Voting with Selection) and Dynamic Voting (DV).\par
The other benchmark called AUE2 (Accuracy Updated Ensemble) \hyperref[b41]{[42]} adapts weighted voting as a combination scheme, where the weights that assigned to individual models are defined in terms of mean squared errors of the models. Learn++ algorithm \hyperref[b42]{[43]} unlike DIC and AUE2 weighs on the current performance over the Non-Stationary Environments, which assign weights to varied individual models depending on the current and the earlier data.\par
The model discussed in \hyperref[b43]{[44]} reflects upon Inductive Transfer (TIX) approach which works on varied methods to gain insights to historical models like given a new chunk of data and the outputs of historical models over training data that are used as features of training data, and a new model is developed with augmented training data. In the instance of building linear models that are built on learning process, TIX can be perceived as one of the special weighted voting scheme, a linear combination of original features of training data can be perceived as outcome of a linear model based on the training data that is original.\par
The other ensemble model DDD (Diversity for Dealing with Drifts) method is discussed in \hyperref[b15]{[16]}. The method focus on using the ensembles as single model for a chosen time step.\par
Existence of concept drift leads to various models with positive and negative effects in terms of learning the current concept. It is very important that whilst getting the positive effects, preventing the negative impacts is also very important. Preserving historical models induce overheads for both storage and computation. Such issues are not usually addressed in DIC, TIX, Learn++NSE. Despite that DS/DVS scheme of DIC and time-adjust error schemes of Learn++NSE shall be resourceful for choosing historical models for preserving, and such adaptations need not be evaluated.\par
SEA and AUE2 usually control the number of preserved models in the conditions of a predefined threshold. Both SEA and AUE2 assess the quality of individual models based on accuracy perspective. Major difference in the way SEA and AUE2 assess is that, SEA takes to account overall accuracy of ensembles of current training data, but AUE2 takes in to account every individual model in consideration over the training data in direct manner.\par
Not many of the existing methods of ensemble that are used for incremental learning has focused on ensemble diversity in an explicit manner, though the diversity is considered to play a critical role in ensembles \hyperref[b44]{[45]}, \hyperref[b45]{[46]}. 
\section[{c) Concept Drift Detection by Statistical Measures}]{c) Concept Drift Detection by Statistical Measures}\par
In \hyperref[b32]{[33]}, the related statistical change detection model was proposed to handle the imbalanced data streaming, wherein the proposed model monitor multiple performance metrics. The technique monitors true positive rate and false positive rate, the true negative rates and the false positive rates attained from the confused matrix of the classification. Unlike the traditional matrix that reflects a biased majority class, the confusion matrix depicts more detailed view that is essential for addressing imbalance class problems. DOD (Degree of Drift) which is an windowbased model identifies the drifts by computing the distance map of all the samples over the current chunk and its nearest neighbours from the earlier chunk \hyperref[b47]{[48]}. The DOD is computed based on distance map and if it increases by a parameter, the drift is signalled.\par
In \hyperref[b48]{[49]}, the Paired Learners approach is proposed which adapts a pair of reactive learner which is trained based on the chunk of data. The model is a stable learner and trained over all the earlier data. The variation of accuracy amidst the two approaches depicts the drift. The disagreement is captured over binary value circular list. Also, the increase in the quantum of ones that are beyond change threshold is signalled as a drift, which is managed by replacing the stable model with a reactive one.\par
In \hyperref[b49]{[50]}, a contemporary model was proposed that depends on the observation of randomly chosen training and testing the samples from a chunk of data which should lead to good accuracy of prediction, unless the window have any kind of non-stationary data. The usually adapted model of classifier's cross validation evaluation \hyperref[b50]{[51]} is the fundamental for the aforesaid model.\par
The OLINDDA (Online Novelty and Drift Detection Algorithm) adapts the K-means data clustering for monitoring continuously and adapt to the emerging data \hyperref[b51]{[52]}. The short term memory queue holds the unknown samples and they are clustered periodically and merged to existing similar cluster profiles or the modern profile to the pol of clusters.\par
In \hyperref[b52]{[53]}, the MINAS were proposed which relies on micro clusters to obtain incremental stream clustering algorithm. It is an extended model to OLINLINDAs approach used for multi class problem. Some of the similar techniques that rely on clustering for defining the boundaries of the known data are Woo Ensemble \hyperref[b53]{[54]}, ECS Miner \hyperref[b54]{[55]}, and DETECTNOD algorithm \hyperref[b55]{[56]}. Samples falling out from the clusters are treated as suspicious \hyperref[b53]{[54]}  \hyperref[b55]{[56]} or the other way as outliers \hyperref[b54]{[55]}. The difference or similarity amidst the defined clusters and suspicious samples are estimated on the account of density that is observed. If similarity attains the suspicious or outlier samples that are incorporated towards corresponding clusters, it concludes the concept drift.\par
In \hyperref[b56]{[57]}, the GC3 approach is an improvisation with a grid density oriented clustering algorithm, wherein the novelty is estimated by considering newly appearing grids in the data space. Such methods \hyperref[b51]{[52]}, \hyperref[b53]{[54]}, \hyperref[b52]{[53]}, \hyperref[b55]{[56]}, \hyperref[b54]{[55]}, \hyperref[b56]{[57]} face challenge of curse of dimensionality and issues of distance methods detection of concept drift in the binary data spaces. Such techniques are effective for multi-class classification problems and many classes might emerge or wane during the process of stream.\par
In \hyperref[b57]{[58]}, the COC (Change of Concept) treats every feature as an independent stream of data and screens the correlation amidst current chunk and the training chunk that has to be referred. The change observed in the average correlation is used for signal of change. Pearson correlation is used which makes the normality assumption to a distribution.\par
In \hyperref[b58]{[59]}, the non-parametric unlabelled approach was proposed in the model of HDDDM (Hellinger Distance Drift Detection Methodology). Hellinger distance is used a measure to change in the distribution.\par
In \hyperref[b59]{[60]} and \hyperref[b60]{[61]}, the PCA (Principal Component Analysis) is used for drift detection computationally efficient for high dimensional data streams. Such techniques reduce set of features essentially to be monitored. Both the methods are contrary in the selection of principal components. PCA models envisage issues because of considerable false alarming rate when compared to the other kind of multivariate distribution models.\par
In \hyperref[b61]{[62]}, \hyperref[b62]{[63]}, \hyperref[b63]{[64]}, \hyperref[b64]{[65]} consider the classification process by taking in to account the posterior probability estimates of classifiers, for identifying the drift. It can be used with probabilistic classifiers that have output of class probabilities before thresholding them to generate any kind of final class label. By tracking the posterior probability estimates, the intensity of drift detection task is reduced to the levels of monitoring univariate stream of values, which enable the process more computationally efficient.\par
Such methods are very effective in reducing the false alarm rates, but their dependence on using the probabilistic models creates implications in terms of the applicability. The methods also impact any kind of change to the posterior distribution in terms of margin samples. Changes that deviate from the margin of classifier are considerably less critical than the classification process, however, none of the approaches offer robustness against them. 
\section[{d) Observations}]{d) Observations}\par
In many of the existing studies the focus is on development of drift detection methods and techniques for addressing the real drift. There is not much of research that has taken place in the domain which might impact the classification purpose and the performance. Despite that afore discussed drifts do not impact the true decision boundaries, it can lead to a better levels of decision boundary. The current techniques for handling the real drift might not be effective for any virtual drift, however, they offer different scenarios to learn and need varied solutions. In the instance of methods to address the real drift that is chosen to reset and retrain the classifier, the old concepts are ignored and the new concepts are learnt, which might not be an appropriate strategy to be used in virtual drift.\par
It could be more effective for calibrating the existing classifier rather than retraining them. Also, the techniques for handling the actual drift very much depends on feedback about the classifier's performance, whilst the techniques towards handling virtual drift shall operate even without the feedback \hyperref[b65]{[66]}. It is imperative from the above review that all the three types discussed has significance and still there is scope for improvement in the models. 
\section[{e) Future Research Objectives}]{e) Future Research Objectives}\par
The future challenges in concept drift could be attributed to the scope of scalability, sturdiness and efficacy of the models right from the levels of adaptation to more interpretable solutions, which can reduce dependency over the time and improve accurate feedback. Even moving from the adaptive algorithms to adaptive systems which could impact the complete knowledge discovery process apart from automating adaptation of the decision models. Few of the challenges envisaged in the process are discussed in \hyperref[b66]{[67]}.\par
The outline of the key issues have to be addressed by the research to ensure that a significant progress in the area of pre-processing techniques for the data stream problems.\par
Limited number of online and supervised discretises that were proposed in the literature reflect that the adjustments turnout to be more abrupt. But the problem is addressed to an extent by inclusion of class information in the discrete zation process. The tweaks that are abrupt and the ones that are labelling are two of the key concerns which must be addressed in the future researches.\par
There is integral need for wrapper-based solutions that were not explored much in the earlier researches. Pure wrapper based on the online learning solutions could limit the computational costs because of the discriminative ability and adaptability to drift. Also, there is need for further research in terms of feature and the instance selection methods which can directly impact the problem of concept drift.\par
IV. 
\section[{Conclusion}]{Conclusion}\par
In this paper, the categorization of the existing models of adaptive learning strategies based on the conceptual models, and the ones that are able to adapt the concept drift in addition to the contemporary techniques. Majority of the concept drift models presume that the changes taken place in the hidden contexts that are complex to be identified in the adaptive learning system. Because of the aforesaid reasons, concept drift is considered as an unpredictable and its detection is profoundly a reactive approach.\par
Numerous application settings wherein the concept drift is considered to be reappearing based on time line and based on varied objects over the modelled domain. The seasonal effects comprising vague periodicity towards a certain subgroup of object can be very common.\par
Availability of external levels of contextual information or the extraction from the hidden contexts based on the predictive features might assign in handling the recurrent concept drift in an effective manner.\par
Majority of the earlier works on the concept drift detection models reviewed in this survey do not address the issues of representation bias which is prevalent in many of the adaptive systems that can direct a specific kind of behaviour. However, when there is any kind of reinforcement feedback or any kind of closed loop control towards learning mechanism, it can't evaluate and compare the performance of the concept drift based on the historical data. Hence, it can be stated that there is need for more emphatic studies that support in embedded concept drift handling in real operational settings towards proper kind of validation. While majority of the works towards handling concept drift has considered the supervised settings having immediate availability, still the actual problems looms much wider.\par
In the process of a supervised learning that emerges over data, and the case of delayed set of ondemand labelling over the supervised learning,   			\footnote{© 2017 Global Journals Inc. (US)} 			\footnote{© 2017 Global Journals Inc. (US) Year 2017 Concept Drift Detection in Data Stream Mining: the Review of Contemporary Literature} 		 		\backmatter  			 \par
adaptation mechanisms are to be investigated. The related research in the domain of concept drift is much beyond the application of machine learning, pattern recognition and the data mining solutions and there could be more explorative solutions in the domain.			 			  				\begin{bibitemlist}{1}
\bibitem[Hayat and Hashemi ()]{b55}\label{b55} 	 		‘A dct based approach for detecting novelty and concept drift in data streams’.  		 			Mortezazi Hayat 		,  		 			Mahmoud Reza Hashemi 		.  	 	 		\textit{Soft Computing and Pattern Recognition (SoCPaR), 2010 International Conference of},  				2010. IEEE.  	 
\bibitem[Gao ()]{b23}\label{b23} 	 		‘A general framework for mining concept-drifting data streams with skewed distributions’.  		 			Jing Gao 		.  	 	 		\textit{Proceedings of the 2007 SIAM International Conference on Data Mining},  		Society for Industrial and Applied Mathematics  		 (the 2007 SIAM International Conference on Data Mining)  		2007.  	 
\bibitem[Sethi et al. ()]{b56}\label{b56} 	 		‘A grid density based framework for classifying streaming data in the presence of concept drift’.  		 			Tegjyot Sethi 		,  		 			Mehmedkantardzic Singh 		,  		 			Hanquing Hu 		.  	 	 		\textit{Journal of Intelligent Information Systems}  		2016. 46 p. .  	 
\bibitem[Wang et al. ()]{b38}\label{b38} 	 		‘A learning framework for online class imbalance learning’.  		 			Wang 		,  		 			Leandro L Shuo 		,  		 			Xin Minku 		,  		 			Yao 		.  	 	 		\textit{Computational Intelligence and Ensemble Learning (CIEL)}  		2013. 2013. IEEE.  	 	 (IEEE Symposium on) 
\bibitem[Sousa et al. ()]{b21}\label{b21} 	 		‘A new dynamic modeling framework for credit risk assessment’.  		 			Maria Sousa 		,  		 			João Rocha 		,  		 			Elísiobrandão Gama 		.  	 	 		\textit{Expert Systems with Applications}  		2016. 45 p. .  	 
\bibitem[Qahtan ()]{b60}\label{b60} 	 		‘A pca-based change detection framework for multidimensional data streams: Change detection in multidimensional data streams’.  		 			Abdulhakim A Qahtan 		.  	 	 		\textit{Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},  				 (the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining)  		2015. ACM.  	 
\bibitem[Street et al. ()]{b39}\label{b39} 	 		‘A streaming ensemble algorithm (SEA) for large-scale classification’.  		 			W Street 		,  		 			Yong Seog Nick 		,  		 			Kim 		.  	 	 		\textit{Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining},  				 (the seventh ACM SIGKDD international conference on Knowledge discovery and data mining)  		2001. ACM.  	 
\bibitem[Kohavi ()]{b50}\label{b50} 	 		‘A study of cross-validation and bootstrap for accuracy estimation and model selection’.  		 			Ron Kohavi 		.  	 	 		\textit{Ijcai}  		1995. 14  (2) .  	 
\bibitem[Batista et al. ()]{b6}\label{b6} 	 		‘A study of the behavior of several methods for balancing machine learning training data’.  		 			Gustavo Eapa Batista 		,  		 			C Ronaldo 		,  		 			Maria Carolina Prati 		,  		 			Monard 		.  	 	 		\textit{ACM Sigkdd Explorations Newsletter}  		2004. 6 p. .  	 
\bibitem[Gama ()]{b65}\label{b65} 	 		‘A survey on concept drift adaptation’.  		 			João Gama 		.  	 	 		\textit{ACM Computing Surveys (CSUR)}  		2014. 46 p. 44.  	 
\bibitem[Dries and Rückert ()]{b61}\label{b61} 	 		‘Adaptive concept drift detection’.  		 			Anton Dries 		,  		 			Ulrich Rückert 		.  	 	 		\textit{Statistical Analysis and Data Mining}  		2009. 2 p. .  	 
\bibitem[Kubat and Matwin ()]{b5}\label{b5} 	 		‘Addressing the curse of imbalanced training sets: one-sided selection’.  		 			Miroslav Kubat 		,  		 			Stan Matwin 		.  	 	 		\textit{ICML}  		1997. 97.  	 
\bibitem[Tang et al. ()]{b45}\label{b45} 	 		‘An analysis of diversity measures’.  		 			E Tang 		,  		 			Ponnuthurai N Ke 		,  		 			Suganthan 		,  		 			Yao 		.  	 	 		\textit{Machine learning}  		2006. 65  (1)  p. .  	 
\bibitem[Ryu and Woo ()]{b53}\label{b53} 	 		‘An efficient method of building an ensemble of classifiers in streaming data’.  		 			Joung Ryu 		,  		 			Woo 		.  	 	 		\textit{International Conference on Big Data Analytics},  				 (Berlin Heidelberg)  		2012. Springer.  	 
\bibitem[López ()]{b13}\label{b13} 	 		‘An insight into classification with imbalanced data: Empirical results and current trends on using data intrinsic characteristics’.  		 			Victoria López 		.  	 	 		\textit{Information Sciences}  		2013. 250 p. .  	 
\bibitem[?liobaite ()]{b64}\label{b64} 	 		‘Change with delayed labeling: When is it detectable?’.  		 			Indre ?liobaite 		.  	 	 		\textit{Data Mining Workshops (ICDMW), 2010 IEEE International Conference on},  				2010. IEEE.  	 
\bibitem[Wu and Chang ()]{b10}\label{b10} 	 		‘Class-boundary alignment for imbalanced dataset learning’.  		 			Gang Wu 		,  		 			Edward Y Chang 		.  	 	 		\textit{ICML 2003 workshop on learning from imbalanced data sets II},  				 (Washington, DC)  		2003.  	 
\bibitem[Masud ()]{b54}\label{b54} 	 		‘Classification and novel class detection in concept-drifting data streams under time constraints’.  		 			Mohammad Masud 		.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		2011. 23 p. .  	 
\bibitem[Gao ()]{b22}\label{b22} 	 		‘Classifying data streams with skewed class distributions and concept drifts’.  		 			Jing Gao 		.  	 	 		\textit{IEEE Internet Computing}  		2008. 12  (6) .  	 
\bibitem[Wu ()]{b24}\label{b24} 	 		‘Classifying imbalanced data streams via dynamic feature group weighting with importance sampling’.  		 			Ke Wu 		.  	 	 		\textit{Proceedings of the 2014 SIAM International Conference on Data Mining},  				 (the 2014 SIAM International Conference on Data Mining)  		2014.  	 
\bibitem[Ditzler ()]{b58}\label{b58} 	 		‘Computational Intelligence in Dynamic and Uncertain Environments (CIDUE)’.  		 			Gregory Ditzler 		,  		 			Robipolikar 		.  	 	 		\textit{IEEE Symposium on}  		2011. 2011. IEEE.  	 	 (Hellinger distance based drift detection for nonstationary environments) 
\bibitem[Wang ()]{b31}\label{b31} 	 		‘Concept drift detection for online class imbalance learning’.  		 			Shuo Wang 		.  	 	 		\textit{The 2013 International Joint Conference on},  				2013. IEEE.  	 	 (Neural Networks (IJCNN)) 
\bibitem[Wang and Abraham ()]{b32}\label{b32} 	 		‘Concept drift detection for streaming data’.  		 			Heng Wang 		,  		 			Zubin Abraham 		.  	 	 		\textit{2015 International Joint Conference on},  				2015. IEEE.  	 
\bibitem[Harel]{b49}\label{b49} 	 		\textit{Concept Drift Detection Through Re sampling},  		 			Maayan Harel 		.  		 ICML. 2014.  		 	 
\bibitem[Minku and Yao ()]{b15}\label{b15} 	 		‘DDD: A new ensemble approach for dealing with concept drift’.  		 			Leandro L Minku 		,  		 			Xin Yao 		.  	 	 		\textit{IEEE transactions on knowledge and data engineering}  		2012. 24 p. .  	 
\bibitem[Lee and Magoules ()]{b57}\label{b57} 	 		‘Detection of concept drift for learning from stream data’.  		 			Jeonghoon Lee 		,  		 			Frederic Magoules 		.  	 	 		\textit{High Performance Computing and Communication \& 2012 IEEE 9th International Conference on Embedded Software and Systems (HPCC-ICESS)},  				2012. 2012. IEEE.  	 	 (IEEE 14th International Conference on) 
\bibitem[Brown ()]{b44}\label{b44} 	 		‘Diversity creation methods: a survey and categorisation’.  		 			Gavin Brown 		.  	 	 		\textit{Information Fusion}  		2005. 6 p. .  	 
\bibitem[Lindstrom et al. ()]{b62}\label{b62} 	 		‘Drift detection using uncertainty distribution divergence’.  		 			Patrick Lindstrom 		,  		 			Brian Mac Namee 		,  		 			Sarah Jane Delany 		.  	 	 		\textit{Evolving Systems}  		2013. 4 p. .  	 
\bibitem[Tsymbal ()]{b40}\label{b40} 	 		‘Dynamic integration of classifiers for handling concept drift’.  		 			Alexey Tsymbal 		.  	 	 		\textit{Information fusion}  		2008. 9 p. .  	 
\bibitem[Mirza et al. ()]{b35}\label{b35} 	 		‘Ensemble of subset online sequential extreme learning machine for class imbalance and concept drift’.  		 			Bilal Mirza 		,  		 			Zhiping Lin 		,  		 			Nan Liu 		.  	 	 		\textit{Neuro computing}  		2015. 149 p. .  	 
\bibitem[Van Hulse et al. ()]{b11}\label{b11} 	 		‘Experimental perspectives on learning from imbalanced data’.  		 			Van Hulse 		,  		 			Taghi M Jason 		,  		 			Amri Khoshgoftaar 		,  		 			Napolitano 		.  	 	 		\textit{Proceedings of the 24th international conference on Machine learning},  				 (the 24th international conference on Machine learning)  		2007. ACM.  	 
\bibitem[Ross ()]{b46}\label{b46} 	 		‘Exponentially weighted moving average charts for detecting concept drift’.  		 			Gordon J Ross 		.  	 	 		\textit{Pattern Recognition Letters}  		2012. 33 p. .  	 
\bibitem[Pan and Shirui ()]{b20}\label{b20} 	 		‘Graph ensemble boosting for imbalanced noisy graph stream classification’.  		 			Pan 		,  		 			Shirui 		.  	 	 		\textit{IEEE transactions on cybernetics}  		2015. 45 p. .  	 
\bibitem[Hoens et al. ()]{b29}\label{b29} 	 		‘Heuristic updatable weighted random subspaces for non-stationary environments’.  		 			T Hoens 		,  		 			Nitesh V Ryan 		,  		 			Robipolikar Chawla 		.  	 	 		\textit{Data Mining (ICDM), 2011 IEEE 11th International Conference on},  				2011. IEEE.  	 
\bibitem[Schlimmer and Granger ()]{b1}\label{b1} 	 		‘Incremental learning from noisy data’.  		 			Jeffrey C Schlimmer 		,  		 			Richard H Granger 		.  	 	 		\textit{Machine learning}  		1986. 1 p. .  	 
\bibitem[Ditzler ()]{b27}\label{b27} 	 		‘Incremental learning of concept drift from streaming imbalanced data’.  		 			Gregory Ditzler 		,  		 			Robipolikar 		.  	 	 		\textit{ieee transactions on knowledge and data engineering}  		2013. 25 p. .  	 
\bibitem[Elwell ()]{b18}\label{b18} 	 		‘Incremental learning of concept drift in nonstationary environments’.  		 			Ryan Elwell 		,  		 			Robipolikar 		.  	 	 		\textit{IEEE Transactions on Neural Networks}  		2011. 22 p. .  	 
\bibitem[Visa ()]{b8}\label{b8} 	 		‘Issues in mining imbalanced data sets-a review paper’.  		 			Sofia Visa 		,  		 			Ancaralescu 		.  	 	 		\textit{Proceedings of the sixteen midwest artificial intelligence and cognitive science conference},  		sn  		 (the sixteen midwest artificial intelligence and cognitive science conference)  		2005. 2005.  	 
\bibitem[Mani and Zhang ()]{b7}\label{b7} 	 		‘kNN approach to unbalanced data distributions: a case study involving information extraction’.  		 			Inderjeet Mani 		,  		 			I Zhang 		.  	 	 		\textit{Proceedings of workshop on learning from imbalanced datasets},  				 (workshop on learning from imbalanced datasets)  		2003.  	 
\bibitem[Polikar ()]{b42}\label{b42} 	 		‘Learn++: An incremental learning algorithm for supervised neural networks’.  		 			Robi Polikar 		.  	 	 		\textit{IEEE transactions on systems, man, and cybernetics, part C (applications and reviews)},  				2001. 31 p. .  	 
\bibitem[Hoens et al. ()]{b19}\label{b19} 	 		‘Learning from streaming data with concept drift and imbalance: an overview’.  		 			T Hoens 		,  		 			Robipolikar Ryan 		,  		 			Nitesh V Chawla 		.  	 	 		\textit{Progress in Artificial Intelligence}  		2012. 1  (1)  p. .  	 
\bibitem[Hoens et al. ()]{b28}\label{b28} 	 		‘Learning in non-stationary environments with class imbalance’.  		 			Thomas Hoens 		,  		 			Nitesh V Ryan 		,  		 			Chawla 		.  	 	 		\textit{Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining},  				 (the 18th ACM SIGKDD international conference on Knowledge discovery and data mining)  		2012. ACM.  	 
\bibitem[Ditzler ()]{b30}\label{b30} 	 		‘Learning in nonstationary environments: A survey’.  		 			Gregory Ditzler 		.  	 	 		\textit{IEEE Computational Intelligence Magazine}  		2015. 10 p. .  	 
\bibitem[Widmer ()]{b2}\label{b2} 	 		‘Learning in the presence of concept drift and hidden contexts’.  		 			Gerhard Widmer 		,  		 			Miroslavkubat 		.  	 	 		\textit{Machine learning}  		1996. 23 p. .  	 
\bibitem[Hoens and Ryan ()]{b14}\label{b14} 	 		\textit{Living in an imbalanced world},  		 			Thomas Hoens 		,  		 			Ryan 		.  		2012.  		 			University of Notre Dame 		 	 
\bibitem[Kubat et al. ()]{b3}\label{b3} 	 		‘Machine learning for the detection of oil spills in satellite radar images’.  		 			Kubat 		,  		 			Robert C Miroslav 		,  		 			Stan Holte 		,  		 			Matwin 		.  	 	 		\textit{Machine learning}  		1998. 30 p. .  	 
\bibitem[Sobhani and Beigy ()]{b47}\label{b47} 	 		\textit{New drift detection method for data streams},  		 			Parinaz Sobhani 		,  		 			Hamid Beigy 		.  		2011. Berlin Heidelberg: Springer.  	 
\bibitem[Zliobaite ()]{b66}\label{b66} 	 		‘Next challenges for adaptive learning systems’.  		 			Indre Zliobaite 		.  	 	 		\textit{ACM SIGKDD Explorations Newsletter}  		2012. 14 p. .  	 
\bibitem[Faria et al. ()]{b52}\label{b52} 	 		‘Novelty detection algorithm for data streams multi-class problems’.  		 			Elaine R Faria 		,  		 			João Gama 		,  		 			André Cplf Carvalho 		.  	 	 		\textit{Proceedings of the 28th annual ACM symposium on applied computing},  				 (the 28th annual ACM symposium on applied computing)  		2013. ACM.  	 
\bibitem[Spinosa et al. ()]{b51}\label{b51} 	 		‘Olindda: A clusterbased approach for detecting novelty and concept drift in data streams’.  		 			Eduardo J Spinosa 		,  		 			André Ponce De Leon F De Carvalho 		,  		 			João Gama 		.  	 	 		\textit{Proceedings of the 2007 ACM symposium on Applied computing},  				 (the 2007 ACM symposium on Applied computing)  		2007. ACM.  	 
\bibitem[Yan ()]{b9}\label{b9} 	 		‘On predicting rare classes with SVM ensembles in scene classification’.  		 			Rong Yan 		.  	 	 		\textit{Proceedings.(ICASSP'03). 2003 IEEE International Conference on},  				 (.(ICASSP'03). 2003 IEEE International Conference on)  		2003. 2003. IEEE. 3.  	 
\bibitem[Ghazi Khani et al. ()]{b37}\label{b37} 	 		‘Online neural network model for nonstationary and imbalanced data stream classification’.  		 			Adel Ghazi Khani 		,  		 			Reza Monsefi 		,  		 			Hadi Sadoghi Yazdi 		.  	 	 		\textit{International Journal of Machine Learning and Cybernetics}  		2014. 5 p. .  	 
\bibitem[Bach and Malo ()]{b48}\label{b48} 	 		‘Paired learners for concept drift’.  		 			Stephen H Bach 		,  		 			Marcus A Malo 		.  	 	 		\textit{Data Mining, 2008. ICDM'08. Eighth IEEE International Conference on},  				2008. IEEE.  	 
\bibitem[Kuncheva and Faithfull ()]{b59}\label{b59} 	 		‘PCA feature extraction for change detection in multidimensional unlabeled data’.  		 			Ludmila I Kuncheva 		,  		 			William J Faithfull 		.  	 	 		\textit{IEEE transactions on neural networks and learning systems},  				2014. 25 p. .  	 
\bibitem[Brzezinski and Wski ()]{b33}\label{b33} 	 		\textit{Prequential AUC for classifier evaluation and drift detection in evolving data streams},  		 			Dariusz Brzezinski 		,  		 			Jerzy Stefano Wski 		.  		2014. Springer International Publishing.  	 	 (International Workshop on New Frontiers in Mining Complex Patterns) 
\bibitem[Brzezinski and Wski]{b34}\label{b34} 	 		\textit{Prequential AUC: Properties of the Area Under the ROC Curve for Data Streams with Concept Drift},  		 			Dariusz Brzezinski 		,  		 			Jerzy Stefano Wski 		.  		 	 
\bibitem[Brzezinski and Stefanowski ()]{b41}\label{b41} 	 		‘Reacting to different types of concept drift: The accuracy updated ensemble algorithm’.  		 			Dariusz Brzezinski 		,  		 			Jerzy Stefanowski 		.  	 	 		\textit{IEEE Transactions on Neural Networks and Learning Systems}  		2014. 25 p. .  	 
\bibitem[Ghazikhani and Monsefi ()]{b36}\label{b36} 	 		‘Recursive least square perceptron model for non-stationary and imbalanced data stream classification’.  		 			Adel Ghazikhani 		,  		 			Reza Monsefi 		,  		 			Hadisadoghiyazdi 		.  	 	 		\textit{Evolving Systems}  		2013. 4 p. .  	 
\bibitem[Chen and He ()]{b26}\label{b26} 	 		‘Sera: selectively recursive approach towards non stationary imbalanced stream data mining’.  		 			Sheng Chen 		,  		 			Haibo He 		.  	 	 		\textit{IJCNN 2009. International Joint Conference on},  				2009. 2009. IEEE.  	 
\bibitem[Chawla ()]{b12}\label{b12} 	 		‘SMOTE: synthetic minority over-sampling technique’.  		 			Nitesh V Chawla 		.  	 	 		\textit{Journal of artificial intelligence research}  		2002. 16 p. .  	 
\bibitem[Forman ()]{b43}\label{b43} 	 		‘Tackling concept drift by temporal inductive transfer’.  		 			George Forman 		.  	 	 		\textit{Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval},  				 (the 29th annual international ACM SIGIR conference on Research and development in information retrieval)  		2006. ACM.  	 
\bibitem[Japkowicz and Stephen ()]{b4}\label{b4} 	 		‘The class imbalance problem: A systematic study’.  		 			Nathalie Japkowicz 		,  		 			Shaju Stephen 		.  	 	 		\textit{Intelligent data analysis}  		2002. 6 p. .  	 
\bibitem[Gantz and Reinsel ()]{b0}\label{b0} 	 		‘The digital universe in 2020: Big data, bigger digital shadows, and biggest growth in the far east’.  		 			John Gantz 		,  		 			David Reinsel 		.  	 	 		\textit{IDC iView: IDC Analyze the future},  				2007. 2012. 2012. p. .  	 
\bibitem[Kelly et al. ()]{b17}\label{b17} 	 		‘The impact of changing populations on classifier performance’.  		 			Mark G Kelly 		,  		 			J David 		,  		 			Niall M Hand 		,  		 			Adams 		.  	 	 		\textit{Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining},  				 (the fifth ACM SIGKDD international conference on Knowledge discovery and data mining)  		1999. ACM.  	 
\bibitem[Minku et al. ()]{b16}\label{b16} 	 		‘The impact of diversity on online ensemble learning in the presence of concept drift’.  		 			Leandro L Minku 		,  		 			P Allan 		,  		 			Xin White 		,  		 			Yao 		.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		2010. 22 p. .  	 
\bibitem[Chen and He ()]{b25}\label{b25} 	 		‘Towards incremental learning of non stationary imbalanced data stream: a multiple selectively recursive approach’.  		 			Sheng Chen 		,  		 			Haibo He 		.  	 	 		\textit{Evolving Systems}  		2011. 2  (1)  p. .  	 
\bibitem[Dredze et al. ()]{b63}\label{b63} 	 		‘We're not in Kansas anymore: detecting domain changes in streams’.  		 			Mark Dredze 		,  		 			Tim Oates 		,  		 			Christine Piatko 		.  	 	 		\textit{Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing},  				 (the 2010 Conference on Empirical Methods in Natural Language Processing)  		2010. Association for Computational Linguistics.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
