-
-
Notifications
You must be signed in to change notification settings - Fork 11
/
DempsterShafer.py
150 lines (133 loc) · 5.13 KB
/
DempsterShafer.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
# -*- coding: utf-8 -*-
"""
Created on Sat Dec 1 14:59:20 2018
@author: Cristian
"""
import argparse
import operator
################ '' is chosen to represent the set of all elements
def getkeys(structure):
return set([elem[0] for elem in structure])
import json
def combination(d1, d2):
united = set(d1.keys()).union(set(d2.keys()))
result=dict.fromkeys(united,0)#init an dictionary with union of keys
#from both sets
#and init values with 0
## Combination
for i in d1.keys():
for j in d2.keys():
if {''}==i and {''}==j:#for intersection between '' ''
result[i]+=d1[i]*d2[j]
else:
if {''}==i:# for case '' 'char'
result[j]+=d1[i]*d2[j]
if {''}==j:# for case 'char' ''
result[i]+=d1[i]*d2[j]
if {''}!=i and {''}!=j:
common = frozenset(i.intersection(j))#save intersection
for k in result.keys():
if (len(common)!=0 and(common==k)):#check if previous intersection is in dict keys
result[k] += d1[i]*d2[j]#if yes, apply the formula
break
##Normalisation
#Round for dict's values
for i in result.keys():
result[i] = round(result[i],4)
#Round for sum of all values
f= sum(list(result.values()))
f=round(f,4)
#divide and round
for i in result.keys():
result[i] =round(result[i]/f,4)
return result
def transformset(input):
return dict((frozenset(elem[0]),elem[1]) for elem in input)
def get_mass(allLines):
mass = {}
previousLine = {}
currentLine = {}
previousLine = transformset(ast.literal_eval(allLines[0]))
#TODO: check if sum equals to 1
for line in range(1,len(allLines)):
if allLines[line][0]!='#':
currentLine = transformset(ast.literal_eval(allLines[line]))
mass = combination(previousLine,currentLine)
previousLine=mass
return mass.copy()
def get_beliefs(masses):
belief = masses.copy()
for i in belief.keys():
for j in belief.keys():
if(i!=j):
#belief for a key = it's mass + masses of existent subsets
if i.issuperset(j) and {''}!=i and {''}!=j:
belief[i]+=masses[j]
for i in belief.keys():
belief[i] = round(belief[i],4) #round with 4 digits
return belief
def get_plausibility(masses):
plausibility = masses.copy()
for i in plausibility.keys():
plausibility[i] = 0 #init elements with 0
for i in plausibility.keys():
for j in plausibility.keys():
if len(i.intersection(j))!=0 and {''}!=i:# if intersection of i and j is not None and i is not ''
plausibility[i]+=masses[j];#add mass of j to plausibilities of i
if {''}==j:
plausibility[i]+=masses[j]#if j is '', add its mass to i
for i in plausibility.keys():
plausibility[i] = round(plausibility[i],4) #round 4 digits
return plausibility
def filter_results(beliefs, plausibility):
finalSet = {}
#Filter elements with same values of beliefs and plausibility with supersets(superset.bel=this.bel, etc...)
for elem in beliefs.keys():
# ssetFlag = False
# for elemb in beliefs.keys():
# if elem!=elemb and elemb.issuperset(elem) and beliefs[elem]==beliefs[elemb] and plausibility[elem]==plausibility[elemb]:
# ssetFlag = True
# break
# if ssetFlag == False and plausibility[elem]!=0.0:
# finalSet[elem] = beliefs[elem]
finalSet[elem] = beliefs[elem]
return finalSet
def get_final_result(elements, plausibility):
resultString = ''
for elem in elements:
setOfElems = elem[0]
movieTypes = str(setOfElems)
# for element in setOfElems:
# movieTypes += decodings[letter]+', '
if elem[0] != {''}:
resultString += movieTypes[11:-2]+' ['+str(elem[1])+', '+str(plausibility[elem[0]])+']\n'
return resultString
parser = argparse.ArgumentParser()
parser.add_argument('--filename', type=str,
help='Path to file with reviews including file name')
args = parser.parse_args()
print(str(args.filename))
pathToFile = args.filename
from pathlib import Path
import ast
mass={}
my_file = Path(pathToFile)
if my_file.is_file():
with open(pathToFile) as f:
lines = f.readlines()
if len(lines)>1:
mass = get_mass(lines)
# print(mass)
# all = frozenset({''})
# if all in mass:
# del mass[all]
beliefs = get_beliefs(mass)
# print(beliefs)
plausibility = get_plausibility(mass)
# print(plausibility)
final_set = filter_results(beliefs, plausibility)
# # print(final_set)
# # #order elements
all_elements=sorted(final_set.items(), key=operator.itemgetter(1),reverse=True)
print("Intervals")
print(get_final_result(all_elements, plausibility))