1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
import numpy as np
import math
from adwin_win_list import AdWinList
from detector import ChangeDetector
class AdwinDetector(ChangeDetector):
def __init__(self, delta = 0.01):
super( AdwinDetector, self ).__init__()
self.DELTA = delta
self.adwin = ADWIN(self.DELTA)
self.is_change_detected = False
self.drift_status = False
def update(self, new_value):
super(AdwinDetector, self).update(new_value)
self.drift_status = self.adwin.set_input(new_value)
def check_change(self, new_value):
self.is_change_detected = False
if self.drift_status:
self.is_change_detected = True
self.adwin = ADWIN(self.DELTA)
class ListItem:
def __init__(self, next_node=None, previous_node=None):
self.bucket_size_row = 0
self.MAXBUCKETS = 5
self.bucket_total = []
self.bucket_variance = []
for i in range(0, self.MAXBUCKETS + 1):
self.bucket_total.append(0)
self.bucket_variance.append(0)
self.next = next_node
self.previous = previous_node
if next_node is not None:
next_node.previous = self
if previous_node is not None:
previous_node.next = self
self.clear()
def clear(self):
self.bucket_size_row = 0
for k in range(0, self.MAXBUCKETS + 1):
self.clear_bucket(k)
def clear_bucket(self, k):
self.set_total(0, k)
self.set_variance(0, k)
def insert_bucket(self, value, variance):
k = self.bucket_size_row
self.bucket_size_row += 1
self.set_total(value, k)
self.set_variance(variance, k)
def remove_bucket(self):
self.compress_buckets_row(1)
def compress_buckets_row(self, number_items_deleted):
for k in range(number_items_deleted, self.MAXBUCKETS + 1):
self.bucket_total[k - number_items_deleted] = self.bucket_total[k]
self.bucket_variance[k - number_items_deleted] = self.bucket_variance[k]
for k in range(1, number_items_deleted + 1):
self.clear_bucket(self.MAXBUCKETS - k + 1)
self.bucket_size_row -= number_items_deleted
def set_previous(self, previous_node):
self.previous = previous_node
def set_next(self, next_node):
self.next = next_node
def get_total(self, k):
return self.bucket_total[k]
def set_total(self, value, k):
self.bucket_total[k] = value
def get_variance(self, k):
return self.bucket_variance[k]
def set_variance(self, value, k):
self.bucket_variance[k] = value
class List:
def __init__(self):
self.count = None
self.head = None
self.tail = None
self.clear()
self.add_to_head()
def is_empty(self):
return self.count == 0
def clear(self):
self.head = None
self.tail = None
self.count = 0
def add_to_head(self):
self.head = ListItem(self.head, None)
if self.tail is None:
self.tail = self.head
self.count += 1
def remove_from_head(self):
self.head = self.head.next
if self.head is not None:
self.head.set_previous(None)
else:
self.tail = None
self.count -= 1
def add_to_tail(self):
self.tail = ListItem(None, self.tail)
if self.head is None:
self.head = self.tail
self.count += 1
def remove_from_tail(self):
self.tail = self.tail.previous
if self.tail is None:
self.head = None
else:
self.tail.set_next(None)
self.count -= 1
class ADWIN:
def __init__(self, delta):
self.DELTA = delta
self.mint_minim_longitud_window = 10
self.mint_time = 0
self.mint_clock = 32
self.last_bucket_row = 0
self.bucket_number = 0
self.detect = 0
self.detect_twice = 0
self.mint_min_win_length = 5
self.MAXBUCKETS = 5
self.TOTAL = 0
self.VARIANCE = 0
self.WIDTH = 0
self.list_row_buckets = List()
def insert_element(self, value):
self.WIDTH += 1
self.insert_element_bucket(0, value, self.list_row_buckets.head)
inc_variance = 0
if self.WIDTH > 1:
inc_variance = (self.WIDTH - 1) * (value - self.TOTAL / (self.WIDTH - 1)) * (value - self.TOTAL / (self.WIDTH - 1)) / self.WIDTH
self.VARIANCE += inc_variance
self.TOTAL += value
self.compress_buckets()
def insert_element_bucket(self, variance, value, node):
node.insert_bucket(value, variance)
self.bucket_number += 1
@staticmethod
def bucket_size(row):
return int(pow(2, row))
def delete_element(self):
node = self.list_row_buckets.tail
n1 = self.bucket_size(self.last_bucket_row)
self.WIDTH -= n1
self.TOTAL -= node.get_total(0)
u1 = node.get_total(0) / n1
inc_variance = node.get_variance(0) + n1 * self.WIDTH * (u1 - self.TOTAL / self.WIDTH) * (u1 - self.TOTAL / self.WIDTH) / (n1 + self.WIDTH)
self.VARIANCE -= inc_variance
if self.VARIANCE < 0:
self.VARIANCE = 0
node.remove_bucket()
self.bucket_number -= 1
if node.bucket_size_row == 0:
self.list_row_buckets.remove_from_tail()
self.last_bucket_row -= 1
return n1
def compress_buckets(self):
cursor = self.list_row_buckets.head
i = 0
while True:
k = cursor.bucket_size_row
if k == self.MAXBUCKETS + 1:
next_node = cursor.next
if next_node is None:
self.list_row_buckets.add_to_tail()
next_node = cursor.next
self.last_bucket_row += 1
n1 = self.bucket_size(i)
n2 = self.bucket_size(i)
u1 = cursor.get_total(0) / n1
u2 = cursor.get_total(1) / n2
inc_variance = n1 * n2 * (u1 - u2) * (u1 - u2) / (n1 + n2)
next_node.insert_bucket(cursor.get_total(0) + cursor.get_total(1), cursor.get_variance(0) + cursor.get_variance(1) + inc_variance)
self.bucket_number += 1
cursor.compress_buckets_row(2)
if next_node.bucket_size_row <= self.MAXBUCKETS:
break
else:
break
cursor = cursor.next
i += 1
if cursor is None:
break
def set_input(self, pr):
bln_change = False
self.mint_time += 1
self.insert_element(pr)
if self.mint_time % self.mint_clock == 0 and self.WIDTH > self.mint_minim_longitud_window:
bln_reduce_width = True
while bln_reduce_width:
bln_reduce_width = False
bln_exit = False
n0 = 0
n1 = self.WIDTH
u0 = 0
u1 = self.TOTAL
cursor = self.list_row_buckets.tail
i = self.last_bucket_row
while True:
for k in range(0, cursor.bucket_size_row):
n0 += self.bucket_size(i)
n1 -= self.bucket_size(i)
u0 += cursor.get_total(k)
u1 -= cursor.get_total(k)
if i == 0 and k == cursor.bucket_size_row - 1:
bln_exit = True
break
if n1 > self.mint_min_win_length + 1 and n0 > self.mint_min_win_length + 1 and self.bln_cut_expression(n0, n1, u0, u1):
self.detect = self.mint_time
if self.detect == 0:
self.detect = self.mint_time
elif self.detect_twice == 0:
self.detect_twice = self.mint_time
bln_reduce_width = True
bln_change = True
if self.WIDTH > 0:
n0 -= self.delete_element()
bln_exit = True
break
cursor = cursor.previous
i -= 1
if not (not bln_exit and cursor is not None):
break
return bln_change
def bln_cut_expression(self, n0, n1, u0, u1):
diff = math.fabs((u0 / n0) - (u1 / n1))
n = self.WIDTH
m = (1 / (n0 - self.mint_min_win_length + 1)) + (1 / (n1 - self.mint_min_win_length + 1))
dd = math.log(2 * math.log(n) / self.DELTA)
v = self.VARIANCE / self.WIDTH
e = math.sqrt(2 * m * v * dd) + 2 / 3 * dd * m
return diff > e