-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.py
More file actions
168 lines (143 loc) · 5.37 KB
/
main.py
File metadata and controls
168 lines (143 loc) · 5.37 KB
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
import numpy as np
from tree import makeNode
from poolTree import PoolTree
import random
import binarytree as bt
import time
import pickle
from evaluation import Evaluation
# model1 = makeNode(data, 4, False, 2, [0,0,0,0])
# eval = Evaluation(model1, evData, 3)
# eval.normalPrint()
# eval.printMkdownStats()
#=========Vars========
DATA_LOCATION = "data"
DUMP_SETTINGS = ("persist/", ".th")
K_FOLD_PARTITIONS = 5
CLASS_AMM = 3
##==========AUX_FUNCS=======
def kFoldDataGen(data,k):
dataLen = len(data)
splitArr = [(i+1)*(dataLen//k) for i in range(k-1)]
return np.split(data, splitArr)
# return spitData
def dumpModel(model, dir):
with open(dir, 'wb') as f:
pickle.dump(model, f)
def crossValidationTrain(kFold, data, classAmm, modelType, argv, dumpArgv):
# Realiza la cross validation con k = kFOld, para la data = data,
# y con el modelo modelType(0 = makeNode, 1 = nodeTree),
# con los parametros argv pasados como array.
# Retorna 3 arrays, los modelos, los tiempos de cada modelo y
# los resultados de cada modelo
print("Cross")
kFoldData = kFoldDataGen(data, kFold)
modelArr = []
timeArr = []
resultArr = []
for i in range(len(kFoldData)):
arrEv = []
arrTr = []
for j, arr in enumerate(kFoldData):
if i == j:
arrEv = arr
else:
if len(arrTr) == 0:
arrTr = arr
else:
arrTr = np.append(arrTr, arr, 0)
start = time.time()
if modelType == 0:
model = makeNode(*argv)
else:
model = PoolTree(*argv)
modelArr.append(model)
timeArr.append(time.time()-start)
dumpDir = dumpArgv[0] + "_RUN_" + str(i) + "_{}_{}".format(argv[3],argv[5]) + dumpArgv[1]
dumpModel(model, dumpDir)
resultArr.append(Evaluation(model, arrEv, classAmm))
return modelArr, timeArr, resultArr
# return [model] [time] [score]
def normalTrain(data, evData, classAmm, modelType, argv, dumpArgv):
start = time.time()
model = makeNode(*argv) if modelType == 0 else PoolTree(*argv)
dumpDir = dumpArgv[0] + "_RUN_" + "WHOLE" + "_{}_{}".format(argv[3],argv[5]) + dumpArgv[1]
timer = time.time()-start
dumpModel(model, dumpDir)
score = Evaluation(model, evData, classAmm)
return model, timer, score
# return mode, time, score
def nodeToBtNode(nodo):
if nodo.false_branch == None:
btNode = bt.Node(nodo.mostCommonValue)
else:
btNode = bt.Node(nodo.cat)
btNode.left = nodeToBtNode(nodo.true_branch)
btNode.right = nodeToBtNode(nodo.false_branch)
return btNode
def makeSimpleTree(metric):
if metric == 'entropy':
tree = makeNode(data, 4, False, 0, [0,0,0,0])
elif metric == 'gini':
tree = makeNode(data, 4, False, 1, [0,0,0,0])
elif metric == 'misclassification':
tree = makeNode(data, 4, False, 2, [0,0,0,0])
print(tree)
print(nodeToBtNode(tree))
return tree
evaluationData = DATA_LOCATION + "/evaluationData.npy"
trainingData = DATA_LOCATION + "/trainingData.npy"
competitionData = DATA_LOCATION + "/competitionData.npy"
data = np.load(trainingData)
evData = np.load(competitionData)
lenEvData = len(evData)
dumpArgv = [DUMP_SETTINGS[0] + DATA_LOCATION, DUMP_SETTINGS[1]]
data = data.astype(float)
evData = evData.astype(float)
compData = np.load(evaluationData).astype(float)
start = time.time()
# Train models
classNameDict = {
1: 'Iris Setosa',
2: 'Iris Versicolour',
3: 'Iris Virginica',
}
if __name__ == "__main__":
attTypes = [0, 0, 0, 0]
argvModel1 = [data, 4, True, 0, attTypes, 0.01]
model1, timer, score = crossValidationTrain(K_FOLD_PARTITIONS, np.append(data, evData,0), CLASS_AMM, 0, argvModel1, dumpArgv)
print('=====================================')
print('====== 5-FOLD CROSS VALIDATION ======')
print('=====================================')
for ind, model in enumerate(model1):
ev = Evaluation(model, evData, 3)
print()
print("5-fold cross validation number", ind+1, "tree:")
print(nodeToBtNode(model))
_, _, microFScore, _, _, macroFScore = ev.getStats()
print('Number ',ind+1, ' - Micro Fscore(0.5) =', microFScore, ' - Macro Fscore(0.5) =', macroFScore)
print('\n\n=====================================')
print('======== POOL OF BINARY TREES =======')
print('=====================================')
model2 = PoolTree(data, 3, 4 , False, 2, [0,0,0,0])
eval = Evaluation(model2, evData, 3)
print('\nResults: ')
eval.printMkdownStats()
print('\n\nConfussion Matrix: \n')
eval.prettyPrintRes(classNameDict)
print('=====================================')
print('\n\n===============================================')
print('======== Trees with different metrics: ========')
print('============= 0: Shannon Entropy ==============')
print('============= 1: Gini Impurity ================')
print('============= 2: Misclassification ============')
print('===============================================')
for i in [0,1,2]:
tree = makeNode(data, 4, False, i, [0,0,0,0])
ev = Evaluation(tree, evData, 3)
print("Function ", i)
print('Results: ', end="")
ev.printMkdownStats()
print('\nConfusion Matrix:')
ev.prettyPrintRes(classNameDict)
print('\n----\n')