/
ts_clustering.py
439 lines (397 loc) · 16.8 KB
/
ts_clustering.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
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
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
'''
Python code for CMSC 734 term project,
based on sklearn package
1. load time series data
2. create similarity matrix
3. clustering
4. rearrange index in similarity matrix based on clustering results
@author: Zheng Xu, xuzhustc@gmail.com, 2015/4/8
'''
import sklearn.metrics.pairwise as skmpw
import sklearn.cluster as skc
import sklearn.decomposition as skd
from enum import Enum
import csv
import numpy as np
import scipy.spatial.distance as spd
import scipy.cluster as spc
# from matplotlib import pyplot as plt
from math import floor
import math
import json
class PatchTS:
'this class describe the patching time series'
'members including the dimension (time points), name of patch, name of application, update mechanism, exploitable flag'
def __init__(self):
self.dim = 0
self.ptchNm = None
self.appNm = None
self.upM = None
self.expFlag = None
self.val = []
self.ftr = []
def setPatchNm(self, nm):
self.ptchNm = nm
def setVal(self, val):
self.val = list(val)
def setAppNm(self, nm):
self.appNm = nm
def setUpM(self, um):
self.upM = um
def setExpF(self, ef):
self.expFlag = ef
def setFtr(self, ftr):
self.ftr = list(ftr)
def trimZeros(self):
# print type(self.val)
# print self.val
for i in range(len(self.val) -1, -1, -1):
if self.val[i] != 0.0:
# self.val = self.val[:i]
# print self.val[:i+1]
if i >0:
return self.val[:i+1]
else:
return None
def JSONifyData(data):
json = []
for ts in data:
json.append({'name': ts.ptchNm , 'app': ts.appNm, 'updateMech': ts.upM, 'exploitable': ts.expFlag})
return json
class TSCluster:
' this class is used to caculate the similarity matrix and do clustering for time series'
def __init__(self):
#members related to time series data
self.tsNum = 0
self.tsDim = 0
self.tsData = []
self.ptchnm2idx = {}
#the filters used and the data after filtering
self.slctData = []
self.slctDataMat = None
self.slctNum = 0
self.slctApp = {'all'}
self.slctUM = {'all'}
self.slctExpF = {'all'}
#similarity matrix and clustering result based on selected data
self.simMat = None
self.cluster = None
#summary of similarity matrix, every smmSc*smmSc integrated into one value
self.simMatSmm = None
self.smmSc = 1
#data ordered after clustering
self.clstData = []
self.clstSimMat = None #this is the final matrix we should use
self.clstLbl = [] #indicate the cluster ID of each data in clustData
self.clstNum = 0 #number of clusters
#the patch name of TS in similarity matrix
self.patchOrdering = None
self.summaryOrdering = None
def loadTS(self, tsFile):
#load time series
with open(tsFile, 'r') as fid:
lines = fid.readlines()
#first line is the number of time series
parts = lines[0].split()
self.tsNum = int(parts[1])
#second line is the dimension of time series, i.e., the maximum date of time series
parts = lines[1].split()
self.tsDim = int(parts[1])
#the rest are time series, format: name\t va1, val2, ... valn\n
for i in xrange(len(lines)-2):
line = lines[i+2]
parts = line.split('\t')
ts = PatchTS()
ts.setPatchNm(parts[0])
parts2 = parts[1].strip(' \t\r\n,').split(',')
if len(parts2) == self.tsDim:
ts.setVal([float(x) for x in parts2])
else:
print 'ts dim: ', self.tsDim, 'vs.', len(parts2)
self.tsData.append(ts)
self.ptchnm2idx[ts.ptchNm] = i
if len(self.tsData) == self.tsNum:
print 'loaded time series:', self.tsNum
def loadAttr(self, attFile):
#load attributes such as update mechanism, application name
with open(attFile, 'rb') as fid:
cr = csv.reader(fid, delimiter = ',', quotechar = '"')
ri = 0
for row in cr:
ri = ri + 1
if 1 == ri:
continue #head
idx = self.ptchnm2idx[row[0]]
ts = self.tsData[idx]
#print ts.ptchNm, row[0]
ts.setAppNm(row[1])
ts.setUpM(row[2])
ts.setExpF(row[6] in ['TRUE','True','true'])
print 'patch time series with attribute:', ri
def loadFtr(self, ftrFile):
#load user input ftr for time series
with open(ftrFile, 'r') as fid:
lines = fid.readlines()
#first line is the number of time series
parts = lines[0].split()
ftrNum = int(parts[1])
#second line is the dimension of ftr
parts = lines[1].split()
ftrDim = int(parts[1])
#the rest are ftrs, format: name\t va1, val2, ... valn\n
for i in xrange(len(lines)-2):
line = lines[i+2]
parts = line.split('\t')
parts2 = parts[1].strip(' \t\r\n,').split(',')
idx = self.ptchnm2idx[parts[0].strip(' "')]
ts = self.tsData[idx]
if len(parts2) == ftrDim:
ts.setFtr([float(x) for x in parts2])
else:
print 'feature dim: ', ftrDim, 'vs.', len(parts2)
def setAppFilter(self, app):
self.slctApp = set(app)
def setUMFilter(self, um):
self.slctUM = set(um)
def setExpFilter(self, exp):
self.slctExpF = set(exp)
def slctTSData(self):
self.slctData = self.tsData
#filter by application
if not 'all' in self.slctApp:
self.slctData = [ts for ts in self.slctData if ts.appNm in self.slctApp]
if not 'all' in self.slctUM:
self.slctData = [ts for ts in self.slctData if ts.upM in self.slctUM]
if not 'all' in self.slctExpF:
self.slctData = [ts for ts in self.slctData if ts.expFlag in self.slctExpF]
print 'selected data:', len(self.slctData)
self.slctExpF = {'all'}
def getSimMat(self, type = 'euclidean', ftr_type = 'data', orderFlag = True, pca_dim=20):
if ftr_type == 'ftr':
#use input features
self.slctData = [ts for ts in self.slctData if ((ts.ftr is not None) and (len(ts.ftr) > 0))]
dataMat = [ts.ftr for ts in self.slctData]
elif ftr_type == 'data':
#use input data
dataMat = [ts.val for ts in self.slctData]
else:
print 'unknown ftr_type for ftr_type:', ftr_type
if pca_dim > len(dataMat):
pca_dim = int(math.ceil(len(dataMat)/2.0))
if type == 'euclidean': #euclidean distance based on time series data
self.simMat = skmpw.euclidean_distances(dataMat)
elif type == 'pca_euc': #extract feature based on PCA, then use Euclidean distance
pca = skd.PCA(n_components=pca_dim)
dataMat = pca.fit_transform(dataMat)
self.simMat = skmpw.euclidean_distances(dataMat)
elif type == 'nmf_euc': #extract feature based on NMF, then use Euclidean distance
nmf = skd.NMF(n_components=pca_dim)
dataMat = nmf.fit_transform(dataMat)
self.simMat = skmpw.euclidean_distances(dataMat)
elif type =='ica_euc': #extract feature based on ICA, then use Euclidean distance
ica = skd.FastICA(n_components=pca_dim)
dataMat = ica.fit_transform(dataMat)
self.simMat = skmpw.euclidean_distances(dataMat)
elif type =='cosine':
self.simMat = skmpw.pairwise_distances(dataMat, metric='cosine')
elif type == 'pca_cos': #extract feature based on PCA, then use cosine distance
pca = skd.PCA(n_components=pca_dim)
dataMat = pca.fit_transform(dataMat)
self.simMat = skmpw.pairwise_distances(dataMat, metric='cosine')
elif type == 'nmf_cos': #extract feature based on NMF, then use cosine distance
nmf = skd.NMF(n_components=pca_dim)
dataMat = nmf.fit_transform(dataMat)
self.simMat = skmpw.pairwise_distances(dataMat, metric='cosine')
elif type =='ica_cos': #extract feature based on ICA, then use cosine distance
ica = skd.FastICA(n_components=pca_dim)
dataMat = ica.fit_transform(dataMat)
self.simMat = skmpw.pairwise_distances(dataMat, metric='cosine')
else:
print 'unknown type for similarity matrix: ', type
#rearrange the order of data in simMat
self.slctDataMat = dataMat
if orderFlag:
link = spc.hierarchy.linkage(self.simMat)
dend = spc.hierarchy.dendrogram(link, no_plot=True)
order = dend['leaves']
self.slctData = [self.slctData[i] for i in order] #rearrange order
self.simMat = [self.simMat[i] for i in order]
for i in xrange(len(self.simMat)):
self.simMat[i] = [self.simMat[i][j] for j in order]
self.slctDataMat = [self.slctDataMat[i] for i in order]
# self.patchOrdering = [ts.ptchNm for ts in self.slctData] #record new ordering
self.patchOrdering = JSONifyData(self.slctData) # Deok wants all the data for each patch in the response
self.clstData = self.slctData
self.clstSimMat = self.simMat
def getSimMatSummary(self, maxSize):
ttlSz = len(self.clstSimMat)
sc = 2.0
while ttlSz/sc > maxSize:
sc = 2.0*sc
print "Summarizing by factor of :"+ str(sc)
newSz = int(math.floor(ttlSz/sc))
sc = int(sc)
simMat = []
summaryOrdering = []
groupSum = []
counter = 0
for i in xrange(newSz):
simMat.append([])
for j in xrange(newSz):
ttl = 0
for i2 in xrange(sc):
for j2 in xrange(sc):
ttl += self.simMat[i*sc+i2][j*sc+j2]
nm_i = self.patchOrdering[i*sc+i2]['name']
# nm_j = self.patchOrdering[j*sc+j2]['name']
# tile = []
# tile.append(nm_i)
# tile.append(nm_j)
# groupSum.append(tile)
if nm_i not in groupSum:
groupSum.append(nm_i)
# if nm_j not in groupSum:
# groupSum.append(nm_j)
simMat[i].append(ttl)
# generate ordering of apps for summary matrix.
summaryOrdering.append({'name': 'group'+str(counter), 'patches': groupSum})
groupSum = []
counter = counter + 1
self.simMatSmm = simMat
self.smmSc = sc
# print summaryOrdering
self.summaryOrdering = summaryOrdering
def getCluster(self, type = 'kmeans', cNum = 20):
if cNum > len(self.slctDataMat):
cNum = int(math.ceil(len(self.slctDataMat)/5.0))
if type == 'kmeans': #kmeans clustering
cm = skc.KMeans(cNum)
self.cluster = cm.fit_predict(np.array(self.slctDataMat))
elif type == 'ap': #affinity propagation
cm = skc.AffinityPropagation(affinity='euclidean')
self.cluster = cm.fit_predict(np.array(self.slctDataMat))
cNum = len(cm.cluster_centers_indices_)
elif type == 'meanshift': #means shift
cm = skc.MeanShift()
self.cluster = cm.fit_predict(np.array(self.slctDataMat))
cNum = len(cm.cluster_centers_)
elif type == 'spectral': #spectral
cm = skc.SpectralClustering(cNum)
self.cluster = cm.fit_predict(np.array(self.slctDataMat))
elif type == 'hc': #hierarchical
cm = skc.AgglomerativeClustering(cNum)
self.cluster = cm.fit_predict(np.array(self.slctDataMat))
elif type == 'dbscan': # DBSCAN
cm = skc.DBSCAN()
self.cluster = cm.fit_predict(np.array(self.slctDataMat))
cNum = len(cm.core_sample_indices_ )
#print cNum
else:
print 'unknown cluster type:', type
#use clustering result to rearrange the order of
clst2idx = [[] for i in xrange(cNum)]
for i in xrange(len(self.cluster)):
clst2idx[self.cluster[i]].append(i)
#caculate average to decide order of clusterings
muClIdx = [np.mean(clst2idx[i]) for i in xrange(cNum)]
idx = np.argsort(muClIdx)
order =[]
for i in xrange(cNum):
order.extend(np.sort(clst2idx[idx[i]]))
self.clstData = [self.slctData[i] for i in order]
self.clstSimMat = [self.simMat[i] for i in order]
for i in xrange(len(self.clstSimMat)):
self.clstSimMat[i] = [self.clstSimMat[i][j] for j in order]
self.clstLbl = [self.cluster[i] for i in order]
self.clstNum = cNum
# self.patchOrdering = [self.patchOrdering[i] for i in order]
self.patchOrdering = JSONifyData(self.clstData)
def drawSimMat(self):
plt.figure()
plt.imshow(self.simMat, interpolation='nearest')
plt.title('SimMat')
plt.colorbar()
plt.ylabel('patches')
plt.xlabel('patches')
def drawClstSimMat(self):
plt.figure()
plt.imshow(self.clstSimMat, interpolation='nearest')
plt.title('SimMat')
plt.colorbar()
plt.ylabel('patches')
plt.xlabel('patches')
def toJSON(self):
"""
Returns a JSON of the similarity matrix and its metadata (patches and their ordering)
Format:
[[ 'patch1', 'patch2', ... ] , [similatiry matrix]]
If we have a lot of data (number of patches > 100 ) it includes the Summary of the similarity matrix like so:
Format:
[[summary matrix] , [ 'patch1', 'patch2', ... ] , [similatiry matrix]]
"""
jsonToRet = []
rowJson = []
matrixJson = []
if len(self.slctData) > 100:
self.getSimMatSummary(100)
jsonToRet.append(self.summaryOrdering)
for i in range(0,len(self.simMatSmm)):
for n in self.simMatSmm[i]:
rowJson.append(n)
matrixJson.append(rowJson)
rowJson = []
jsonToRet.append(matrixJson)
jsonToRet.append(self.patchOrdering)
# jsonToRet = []
rowJson = []
matrixJson = []
for i in range(0,len(self.simMat)):
for n in self.simMat[i]:
rowJson.append(n)
matrixJson.append(rowJson)
rowJson = []
jsonToRet.append(matrixJson)
return jsonToRet
def drawSimMatSummary(self):
plt.figure()
labels = [ts.ptchNm for ts in self.slctData]
plt.imshow(self.simMatSmm, interpolation='nearest')
plt.title('SimMat')
plt.colorbar()
plt.ylabel('patches')
plt.xlabel('patches')
def writeSimMatCSV(self, lblNmFile, matFile):
lblNm = [ts.ptchNm for ts in self.slctData]
with open(lblNmFile, 'w') as fid:
for lbl in lblNm:
fid.write(str(lbl))
fid.write('\n')
with open(matFile, 'w') as fid:
for row in self.simMat:
for val in row:
fid.write(str(val))
fid.write(',')
fid.write('\n')
def printAllAppNm(self):
for i in xrange(self.tsNum):
print self.tsData[i].appNm
def getStatstics(self):
print 'total time series: ', len(self.tsData)
appList = [ts.appNm for ts in self.tsData]
upList = [ts.upM for ts in self.tsData]
expList = [ts.expFlag for ts in self.tsData]
appSet = set(appList)
upSet = set(upList)
expSet = set(expList)
print appSet
print upSet
print expSet
for app in appSet:
tmp = [ts for ts in self.tsData if ts.appNm == app]
print app, ':', len(tmp)
for up in upSet:
tmp = [ts for ts in self.tsData if ts.upM == up]
print up, ':', len(tmp)
for exp in expSet:
tmp = [ts for ts in self.tsData if ts.expFlag == exp]
print exp, ':', len(tmp)