/
Meselo.py
219 lines (198 loc) · 6.46 KB
/
Meselo.py
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
import time
from Trie import *
from Episode import *
from window import *
import sys
class Meselo():
def __init__(self,events,minsup,delta,upperdelta,debug):
self.minsup=minsup
self.delta=delta
self.upperdelta=upperdelta
self.events=events
self.debug=debug
self.M_ex=[]
self.M_in=[]
self.C=set()
self.F=set()
self.sp={}
def apply(self):
i=-1
for newEventSet in self.events:
if self.debug:
print("Iteration k = "+ str(i) +"...")
self.meselo(newEventSet,i)
if self.debug:
print("F = ")
print(self.F)
print("C = ")
print(self.C)
print("sp = ")
print(self.sp )
i+=1
print("sp = ")
print(self.sp)
return self.F
def buildTrie(self,newEventSet,k):
root=Trie('0',k+1)
for c in newEventSet:
node=Trie(c,k+1)
root.children.append(node)
return root
def updateTries(self,M_in,newEventSet,k):
Q=set()
for c in newEventSet:
list=[]
list.append(c)
Q.add(Episode(list,Window(k+1,k+1)))
i=k
if self.debug:
print("Q after adding 1-episodes:"+ str(Q))
while i>=k-self.delta+2 and i>=0:
if self.debug:
print("M_in:"+str(M_in))
t=self.M_in[len(self.M_in)-(k-i)-2]
if self.debug:
print("t grabbed from M_in:")
print(t)
self.travel(t,[],t.time,newEventSet,i,k,Q)
i-=1
return Q
def travel(self,t,currentPath,startTime,newEventSet,i,k,Q):
path=currentPath.copy()
children=t.children.copy()
if t.event!='0':
path.append(t.event)
if t.isLO:
alpha=Episode(path,Window(startTime,t.time))
if self.debug:
print("alpha :")
print(alpha)
self.visit(t,alpha,newEventSet,i,k,Q)
for child in children:
self.travel(child,path,startTime,newEventSet,i,k,Q)
def visit(self,p,alpha,newEventSet,i,k,Q):
for e in newEventSet:
comparison=False
for child in p.children:
if child.event==e:
comparison=True
if comparison:
if self.debug:
print('Already have')
else:
q=Trie(e,k+1)
p.children.append(q)
if self.debug:
print("New Trie:")
print(p)
print("alpha.events:"+str(alpha.events))
qAlphaPath=alpha.events.copy()
if self.debug:
print("qAlphaPath:"+str(qAlphaPath))
qAlphaPath.append(e)
qAlpha=Episode(qAlphaPath,Window(i,k+1))
Q.add(qAlpha)
if self.debug:
print("New Q:")
for ep in Q:
print(Q)
contained=False
for ep in Q:
if str(ep.events)==str(alpha.events):
contained=True
if contained:
p.isLO=False
if self.debug:
print("P:")
print(p)
def outputF(self,Q,k,upperDelta,minSup):
if k-upperDelta+1>=0:
loaded=self.M_ex[k - upperDelta + 1]
if self.debug:
print("M_ex:")
print(self.M_ex)
index=k-upperDelta+1
print("M_ex.size()="+str(len(self.M_ex))+",index of loaded="+str(index))
print("Loaded from M_ex:")
print(loaded)
if self.debug:
print("sp-before:")
print(self.sp)
self.travel2(loaded,[],loaded.time)
for alpha in Q:
newkey=str(alpha.events)
if self.debug:
print("new_alpha.events:"+str(alpha.events))
freq=self.sp.get(newkey)
if freq==None:
self.sp.update({newkey:1})
else:
self.sp.update({newkey:freq+1})
if self.debug:
print("sp-after:"+str(self.sp))
self.F=set()
self.C=set()
for get_L in self.sp.items():
x,y=get_L
if y>=self.minsup:
self.F.add(x)
else:
self.C.add(x)
return self.F
def travel2(self,t,currentPath,startTime):
path=currentPath.copy()
if t.event!='0':
path.append(t.event)
alpha=Episode(path,Window(startTime,t.time))
newkey=str(alpha.events)
freq=self.sp.get(newkey)
if self.debug:
print("alpha.events:"+str(alpha.events))
if freq==None or freq==0:
if self.debug:
print("Eipsode not found in map:"+alpha)
elif freq==1:
del(self.sp[newkey])
else:
self.sp.update({newkey:freq-1})
for child in t.children:
self.travel2(child,path,startTime)
def meselo(self,newEventSet,k):
print('!!!!!!!!!')
if self.debug:
print("New event set:"+str(newEventSet))
newTrie=self.buildTrie(newEventSet,k)
if self.debug:
print("newTrie:"+str(newTrie))
print("M_in:"+str(self.M_in))
self.M_in.append(newTrie)
if self.debug:
print("M_in after adding newTrie:"+str(self.M_in))
Q=self.updateTries(self.M_in,newEventSet,k)
if self.debug:
print("Q after 'updateTries':"+str(Q))
if(len(self.M_in)==self.delta):
#print("*******M_in[0]:")
# print(self.M_in[0])
# print(self.M_in[0].children)
toSwitch=self.M_in[0]
self.M_in.remove(self.M_in[0])
# print("***TOSEITCH:")
# print(toSwitch)
self.M_ex.append(toSwitch)
if self.debug:
print("Last M_in:"+str(self.M_in))
print("Last M_in size:"+str(len(self.M_in)))
print("Last M_ex:"+str(self.M_ex))
print("Last M_ex size:" + str(len(self.M_ex)))
self.F=self.outputF(Q,k,self.upperdelta,self.minsup)
'''i='boy'
a=set('boy')
a.add('python')
a.add(i)
a.add(Trie('0',1))
a.add(Episode('A',Window(0,1)))
print(a)
c=[1,2,3]
c.remove(c[0])
print(c)'''