Incremental Optimization Mechanism for Constructing a Decision Tree in Data Stream Mining

<table>VFDT performance for: (a) ideal data, (b) data with noise, (c) data with noise and bias. <svg height="11.175" id="M93" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 13.5875 11.175" width="13.5875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M775 650l-6 -28q-60 -6 -81.5 -16t-61.5 -54l-175 -191l125 -243q30 -58 48.5 -71t82.5 -19l-5 -28h-275l7 28l35 4q31 4 37 12t-6 34l-108 216q-140 -165 -177 -219q-16 -22 -10.5 -30.5t41.5 -13.5l22 -3l-7 -28h-244l8 28q52 4 75 15.5t67 52.5q48 46 206 231
l-110 215q-26 51 -44 63t-72 17l6 28h250l-6 -28l-27 -4q-30 -5 -35 -10t3 -27q17 -43 95 -190q70 78 154 185q15 21 10 29.5t-33 12.5l-30 4l5 28h236z" id="x1D44B"></path></g>
</svg>-axis presents the accuracy and <svg height="12.175" id="M94" style="vertical-align:-3.56265pt" version="1.1" viewbox="0 0 9.9624996 12.175" width="9.9624996" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M556 393q0 -39 -36 -106q-42 -78 -185 -279q-47 -66 -81 -108t-117 -135l-112 -26l-8 22q150 90 251 219q-6 136 -39 340q-8 53 -21 53q-6 0 -27 -19.5t-38 -42.5l-16 26q80 111 127 111q23 0 35 -28t20 -90q18 -137 27 -263h2q142 200 142 279q0 24 -14 48q-4 7 5 26
q13 28 43 28q18 0 30 -15.5t12 -39.5z" id="x1D466"></path></g>
</svg>-axis the number of samples. </table>

Mathematical Problems in Engineering

fig2

Figure 2

Figure 2: Incremental Optimization Mechanism for Constructing a Decision Tree in Data Stream Mining 