-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathevaluate.py
More file actions
116 lines (83 loc) · 2.93 KB
/
Copy pathevaluate.py
File metadata and controls
116 lines (83 loc) · 2.93 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
import torch
import torch.nn as nn
import numpy as np
import math
from sklearn.metrics import mean_squared_error, mean_absolute_error
class evaluate_result():
def __init__(self):
super(evaluate_result,self).__init__()
def CRA(self, predict, label):
cra = 0
total_len = 0
for i in range(len(predict)):
total_len += len(predict[i])
for j in range(len(predict[i])):
cra += 1-(abs(label[i][j]-predict[i][j])/label[i][j])
return cra/total_len
def RMSE(self, predict, label):
total_len = 0
rmse = 0
for i in range(len(predict)):
total_len += len(predict[i])
for j in range(len(predict[i])):
rmse += (label[i][j]-predict[i][j])*(label[i][j]-predict[i][j])
return math.sqrt(rmse/total_len)
def MAE(self, predict,label):
total_len = 0
mae = 0
for i in range(len(predict)):
total_len += len(predict[i])
for j in range(len(predict[i])):
mae += abs(label[i][j]-predict[i][j])
return mae/total_len
def MAPE(self, predict, label):
mape = 0
total_len=0
for i in range(len(predict)):
total_len += len(predict[i])
for j in range(len(predict[i])):
mape +=abs((label[i][j]-predict[i][j])/label[i][j])
return mape/total_len
def rul_score(self, predict, label):
score = 0
for i in range(len(predict)):
for j in range(len(predict[i])):
h = predict[i][j] - label[i][j]
if h < 0:
score+=(math.exp(-h/13)-1)
else:
score+=(math.exp(h/10)-1)
return score
def CRA_smoothed(self, predict, label):
cra = 0
total_len = len(predict)
for i in range(len(predict)):
cra += 1-(abs(label[i]-predict[i])/label[i])
return cra/total_len
def RMSE_smoothed(self, predict, label):
total_len = len(predict)
rmse = 0
for i in range(len(predict)):
rmse += (label[i]-predict[i])*(label[i]-predict[i])
return math.sqrt(rmse/total_len)*100
def MAE_smoothed(self, predict,label):
mae = 0
total_len = len(predict)
for i in range(len(predict)):
mae += abs(label[i]-predict[i])
return mae/total_len*100
def MAPE_smoothed(self, predict, label):
mape = 0
total_len=len(predict)
for i in range(len(predict)):
mape +=abs((label[i]-predict[i])/label[i])
return mape/total_len*100
def rul_score_smoothed(self, predict, label):
score = 0
for i in range(len(predict)):
h = predict[i] - label[i]
if h < 0:
score+=(math.exp(-h/13)-1)
else:
score+=(math.exp(h/10)-1)
return score