-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathEnvironment.py
More file actions
412 lines (336 loc) · 10.2 KB
/
Environment.py
File metadata and controls
412 lines (336 loc) · 10.2 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
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
import torch
import random
import json
import pickle
from queue import Queue
import matplotlib.pyplot as plt
import logging
from utils import normalize,logger,global_device
from torch.nn.init import xavier_normal_, xavier_uniform_
class node:
def __init__(self,x,y=None,pre=None,next=None,level=1):
self.x=x
self.y=y
self.pre=pre
self.next=next
self.level=level
def back(self):
M=[(self.y,self.x)]
t = self.pre
while t!=None:
M.append((t.y,t.x))
t=t.pre
return M[::-1]
class env(object):
def __init__(self,datapath,pretrain=None,dim=100):
self.vec_dim=dim
for k,v in datapath.items():
setattr(self,k,self.load_file(v))
logger.info('load env.%s success...'%k)
self.triple_num = len(self.graph)
self.init_data()
if pretrain:
self.init_embedding_from_pretrain()
else:
self.init_embedding()
self.triple2adj()
self.parameter={}
def init_data(self):
assert len(self.relation2id) not in self.relation2id.values()
self.type2id['OP'] = len(self.type2id)
self.type2id['START'] = len(self.type2id)
self.ent2type['OP'] = ['OP']
self.ent2type['START'] = ['START']
self.entity2id['OP'] = len(self.entity2id)
self.entity2id['START'] = len(self.entity2id)
self.ent2type_id = {}
for k, v in self.ent2type.items():
self.ent2type_id[self.entity2id[k]] = [self.type2id[i] for i in v]
self.entid2name = {v: k for k, v in self.entity2id.items()}
self.typeid2name = {v: k for k, v in self.type2id.items()}
self.relation2id['OP'] = len(self.relation2id)
self.relation2id['START'] = len(self.relation2id)
self.relid2name = {v: k for k, v in self.relation2id.items()}
self.type_num = len(self.type2id)
self.ent_num = len(self.entity2id)
self.rel_num = len(self.relation2id)
self.relOPid = self.relation2id['OP']
self.relStartid = self.relation2id['START']
self.entOPid = self.entity2id['OP']
self.entStartid = self.entity2id['START']
def init_embedding(self):
self.rel_vec = torch.nn.Embedding(self.rel_num, self.vec_dim)
xavier_uniform_(self.rel_vec.weight.data)
self.type_vec = torch.nn.Embedding(self.ent_num, self.vec_dim)
xavier_uniform_(self.type_vec.weight.data)
if global_device=='cuda:0':
self.rel_vec=self.rel_vec.cuda()
self.type_vec=self.type_vec.cuda()
def init_embedding_from_pretrain(self):
self.rel_vec = self.embeddings['rel_embeddings'].copy()
self.vec_dim = len(self.rel_vec[0])
relOP_vec = [(random.random() - 0.5) / self.vec_dim ** 0.5 for _ in range(self.vec_dim)]
relOP_vec = normalize(relOP_vec, norm=2)
relStart_vec = [(random.random() - 0.5) / self.vec_dim ** 0.5 for _ in range(self.vec_dim)]
relStart_vec = normalize(relStart_vec, norm=2)
self.rel_vec.append(relOP_vec)
self.rel_vec.append(relStart_vec)
self.type_vec = self.embeddings['ent_embeddings'].copy()
entOP_vec = [(random.random() - 0.5) / self.vec_dim ** 0.5 for _ in range(self.vec_dim)]
entOP_vec=normalize(entOP_vec,norm=2)
entStart_vec = [(random.random() - 0.5) / self.vec_dim ** 0.5 for _ in range(self.vec_dim)]
entStart_vec=normalize(entStart_vec,norm=2)
entOP_vec = torch.tensor(entOP_vec, dtype=torch.float32)
entStart_vec = torch.tensor(entStart_vec, dtype=torch.float32)
self.type_vec.append(entOP_vec)
self.type_vec.append(entStart_vec)
del self.embeddings
rel_vec = torch.nn.Embedding(self.rel_num, self.vec_dim)
rel_vec.from_pretrained(torch.tensor(self.rel_vec), freeze=False)
self.rel_vec = rel_vec
type_vec = torch.nn.Embedding(self.ent_num, self.vec_dim)
type_vec.from_pretrained(torch.tensor(self.type_vec), freeze=False)
self.type_vec = type_vec
if global_device=='cuda:0':
self.rel_vec=self.rel_vec.cuda()
self.type_vec=self.type_vec.cuda()
print('typevec device:',self.type_vec.weight.device)
def parameters(self):
return list(self.rel_vec.parameters())+list(self.type_vec.parameters())
def init_relation_query_state(self,relation):
assert self.graph_state == 'adj'
if type(relation)==str:
relation=self.relation2id[relation]
kb = {}
kb_inv = {}
self.query=[]
for i in self.triple:
e1, e2, r = i[0], i[1], i[2]
e1, e2, r = self.entity2id[e1], self.entity2id[e2], self.relation2id[r]
if relation==r:
self.query.append(i)
else:
if e1 in kb:
kb[e1].append((r, e2))
else:
kb[e1] = [(r, e2)]
if e2 in kb_inv:
kb_inv[e2].append((r, e1))
else:
kb_inv[e2] = [(r, e1)]
self.graph = kb
self.graph_inv = kb_inv
return self.query
def triple2adj(self):
assert hasattr(self,'graph')
kb={}
for i in self.graph:
e1,e2,r=i[0],i[1],i[2]
e1,e2,r=self.entity2id[e1],self.entity2id[e2],self.relation2id[r]
if e1 in kb:
kb[e1].append((r,e2))
else:
kb[e1]=[(r,e2)]
self.triple=self.graph.copy()
self.graph=kb
self.graph_state='adj'
def load_file(self,path):
if path[-5:]=='.json':
with open(path,'r') as fin:
file=json.load(fin)
elif path[-4:]=='.pkl':
with open(path,'rb') as fin:
file=pickle.load(fin)
else:
with open(path,'r') as fin:
file=[]
for i in fin.readlines():
file.append(i.stripl().split())
return file
def get_initial_state(self,e1,target_e):
next_e=e1
cur_r,cur_e=self.relStartid,self.entStartid
return cur_e,cur_r,next_e,target_e
def get_neighbor_relation(self,ent):
assert self.graph_state=='adj'
path_list=self.graph[ent]
neighbor_relation=[i[0] for i in path_list]
assert len(neighbor_relation)>0
return neighbor_relation
def get_action_space(self,ent):
assert self.graph_state == 'adj'
try:
path_list = self.graph[ent]
except:
logger.debug('Key error:%s'%str(self.entid2name[ent]))
return []
res=set([])
for i in path_list:
res.add(i[0])
res.add(self.relation2id['OP'])
assert len(res) > 0
return list(res)
def get_state_vec(self,cur_e,cur_r,target_e,mode='cat'):
if mode=='cat':
cur_e_vec=self.entid2vec(cur_e)
cur_r_vec=self.relid2vec(cur_r)
tar_e_vec=self.entid2vec(target_e)
return torch.cat((cur_e_vec,cur_r_vec,tar_e_vec),dim=0)
def entid2vec(self,ent,max_type=30):
type_list=self.ent2type_id[ent]
type_list=torch.tensor(type_list,device=torch.device(global_device))
ent_type_sum=self.type_vec(type_list)
ent_type_sum=torch.sum(ent_type_sum,dim=0)
return ent_type_sum
def relid2vec(self,rel):#int
rel=torch.tensor(rel,device=torch.device(global_device))
return self.rel_vec(rel)
def choose_e_from_action(self,ent,action):
path_list=self.graph[ent]
L=[]
for i in path_list:
if i[0]==action:
L.append(i[1])
return random.choice(L)
def traj2list(self,traj):
L=[]
for i in traj[1:]:
e1,r=i[0],i[1]
if e1 != 'OP' and e1 != 'START':
e1=self.entid2name[e1]
if r!='OP' and r!='START':
r=self.relid2name[r]
L.append(e1)
L.append(r)
L.append(self.entid2name[traj[-1][2]])
return L
def traj_for_showing(self,traj):
res_str=[]
for i in traj:
e1,r,e2=i[0],i[1],i[2]
if e1 != 'OP' and e1 != 'START':
e1=self.entid2name[e1]
if e2!='OP' and e2!='START':
e2=self.entid2name[e2]
if r!='OP' and r!='START':
r=self.relid2name[r]
fil=e1+'~~'+r+'~~'+e2
res_str.append(fil)
res_str='==='.join(res_str)
res_str=res_str.replace('>','')
res_str=res_str.replace('<','')
return res_str
def In_type(self,e, typelist):
if type(e) == int:
e = self.entid2name[e]
typelist_e = self.ent2type[e]
for m in typelist_e:
if m in typelist:
return True
return False
def near_negative_sampling(self,ent,target_type,max_len=7,lowest_level=1):
if type(ent)==str:
ent=self.entity2id[ent]
q = Queue()
q.put(node(ent, level=1))
l = 1
negtive_paris = []
while not q.empty():
cur = q.get()
if cur.level>=lowest_level and self.In_type(cur.x,target_type):
negtive_paris.append((ent,cur.x))
if cur.x in self.graph and cur.level <= max_len:
if len(self.graph[cur.x]) > 0:
l += 1
for i in self.graph[cur.x]:
q.put(node(i[1], pre=cur, level=l, y=i[0]))
if len(negtive_paris)>=3:
random.shuffle(negtive_paris)
return [(self.entid2name[t[0]], self.entid2name[t[1]]) for t in negtive_paris[:3]]
elif len(negtive_paris)>0:
return [(self.entid2name[t[0]], self.entid2name[t[1]]) for t in negtive_paris]
else:
return []
def iscircle(self,path):
if len(set(path))==len(path):
return False
else:
return True
def path_traverse_BFS(self,e1,e2,max_len=4):
if type(e1)==str:
e1=self.entity2id[e1]
if type(e2)==str:
e2=self.entity2id[e2]
q = Queue()
q.put(node(e1,level=1))
l = 1
paths=[]
while not q.empty():
cur = q.get()
if cur.x == e2:
backpath=cur.back()
if not self.iscircle(backpath):
paths.append(backpath)
if cur.x in self.graph and cur.level <= max_len:
if len(self.graph[cur.x]) > 0:
l += 1
for i in self.graph[cur.x]:
q.put(node(i[1],pre=cur,level=l,y=i[0]))
M=[]
for i in paths:
L=[]
for j in i:
if j[0] is not None:
L.append(self.relid2name[j[0]])
L.append(self.entid2name[j[1]])
M.append(L)
return M
def BFS(self,e1,e2,max_len=4):
q=Queue()
q.put(e1)
mark_q=Queue()
l=1
mark_q.put(l)
while not q.empty():
cur=q.get()
cur_l=mark_q.get()
if cur==e2:
return True
if cur in self.graph and l<=max_len:
if len(self.graph[cur])>0:
l+=1
for i in self.graph[cur]:
q.put(i[1])
mark_q.put(l)
return False
def filter_query(self,max_len=5,maxnum=None):
assert len(self.query)>0
self.filter_query=[]
count=0
if maxnum is None:
maxnum=10000000
for k, fact in enumerate(self.query):
e1, e2 = fact[0], fact[1]
e1, e2 = self.entity2id[e1], self.entity2id[e2]
res = self.BFS(e1, e2, max_len=max_len)
if res:
count+=1
self.filter_query.append(fact)
if k % int(len(self.query) * 0.1) == 0 and k > 0:
logger.info("%%%.3f test..." % (k * 100 / len(self.query)))
if count>=maxnum:
logger.info('Got %d queries..'%count)
break
logger.info("%%%.3f have been left.." % (100*(count / len(self.query))))
def txt2json(path):
res={}
with open(path,'r') as fin:
for i in fin.readlines():
line=i.strip().split()
if len(line)==2:
res[line[0]]=int(line[1])
if path[-4:]=='.txt':
path=path[:-4]+'.json'
with open(path,'w') as fin:
json.dump(res,fin)
return res