-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathdata_loader.py
161 lines (135 loc) · 6.07 KB
/
data_loader.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
import random
import numpy as np
class DataLoader(object):
def __init__(self, dataset, parameter, step='train'):
self.curr_rel_idx = 0
self.tasks = dataset[step+'_tasks']
self.rel2candidates = dataset['rel2candidates']
self.e1rel_e2 = dataset['e1rel_e2']
self.all_rels = sorted(list(self.tasks.keys()))
self.num_rels = len(self.all_rels)
self.few = parameter['few']
self.bs = parameter['batch_size']
self.nq = parameter['num_query']
if step != 'train':
self.eval_triples = []
for rel in self.all_rels:
self.eval_triples.extend(self.tasks[rel][self.few:])
self.num_tris = len(self.eval_triples)
self.curr_tri_idx = 0
def next_one(self):
# shift curr_rel_idx to 0 after one circle of all relations
if self.curr_rel_idx % self.num_rels == 0:
random.shuffle(self.all_rels)
self.curr_rel_idx = 0
# get current relation and current candidates
curr_rel = self.all_rels[self.curr_rel_idx]
self.curr_rel_idx = (self.curr_rel_idx + 1) % self.num_rels # shift current relation idx to next
curr_cand = self.rel2candidates[curr_rel]
while len(curr_cand) <= 10 or len(self.tasks[curr_rel]) <= 10: # ignore the small task sets
curr_rel = self.all_rels[self.curr_rel_idx]
self.curr_rel_idx = (self.curr_rel_idx + 1) % self.num_rels
curr_cand = self.rel2candidates[curr_rel]
# get current tasks by curr_rel from all tasks and shuffle it
curr_tasks = self.tasks[curr_rel]
curr_tasks_idx = np.arange(0, len(curr_tasks), 1)
curr_tasks_idx = np.random.choice(curr_tasks_idx, self.few+self.nq)
support_triples = [curr_tasks[i] for i in curr_tasks_idx[:self.few]]
query_triples = [curr_tasks[i] for i in curr_tasks_idx[self.few:]]
# construct support and query negative triples
support_negative_triples = []
for triple in support_triples:
e1, rel, e2 = triple
while True:
negative = random.choice(curr_cand)
if (negative not in self.e1rel_e2[e1 + rel]) \
and negative != e2:
break
support_negative_triples.append([e1, rel, negative])
negative_triples = []
for triple in query_triples:
e1, rel, e2 = triple
while True:
negative = random.choice(curr_cand)
if (negative not in self.e1rel_e2[e1 + rel]) \
and negative != e2:
break
negative_triples.append([e1, rel, negative])
return support_triples, support_negative_triples, query_triples, negative_triples, curr_rel
def next_batch(self):
next_batch_all = [self.next_one() for _ in range(self.bs)]
support, support_negative, query, negative, curr_rel = zip(*next_batch_all)
return [support, support_negative, query, negative], curr_rel
def next_one_on_eval(self):
if self.curr_tri_idx == self.num_tris:
return "EOT", "EOT"
# get current triple
query_triple = self.eval_triples[self.curr_tri_idx]
self.curr_tri_idx += 1
curr_rel = query_triple[1]
curr_cand = self.rel2candidates[curr_rel]
curr_task = self.tasks[curr_rel]
# get support triples
support_triples = curr_task[:self.few]
# construct support negative
support_negative_triples = []
shift = 0
for triple in support_triples:
e1, rel, e2 = triple
while True:
negative = curr_cand[shift]
if (negative not in self.e1rel_e2[e1 + rel]) \
and negative != e2:
break
else:
shift += 1
support_negative_triples.append([e1, rel, negative])
# construct negative triples
negative_triples = []
e1, rel, e2 = query_triple
for negative in curr_cand:
if (negative not in self.e1rel_e2[e1 + rel]) \
and negative != e2:
negative_triples.append([e1, rel, negative])
support_triples = [support_triples]
support_negative_triples = [support_negative_triples]
query_triple = [[query_triple]]
negative_triples = [negative_triples]
return [support_triples, support_negative_triples, query_triple, negative_triples], curr_rel
def next_one_on_eval_by_relation(self, curr_rel):
if self.curr_tri_idx == len(self.tasks[curr_rel][self.few:]):
self.curr_tri_idx = 0
return "EOT", "EOT"
# get current triple
query_triple = self.tasks[curr_rel][self.few:][self.curr_tri_idx]
self.curr_tri_idx += 1
# curr_rel = query_triple[1]
curr_cand = self.rel2candidates[curr_rel]
curr_task = self.tasks[curr_rel]
# get support triples
support_triples = curr_task[:self.few]
# construct support negative
support_negative_triples = []
shift = 0
for triple in support_triples:
e1, rel, e2 = triple
while True:
negative = curr_cand[shift]
if (negative not in self.e1rel_e2[e1 + rel]) \
and negative != e2:
break
else:
shift += 1
support_negative_triples.append([e1, rel, negative])
# construct negative triples
negative_triples = []
e1, rel, e2 = query_triple
for negative in curr_cand:
if (negative not in self.e1rel_e2[e1 + rel]) \
and negative != e2:
negative_triples.append([e1, rel, negative])
support_triples = [support_triples]
support_negative_triples = [support_negative_triples]
query_triple = [[query_triple]]
negative_triples = [negative_triples]
return [support_triples, support_negative_triples, query_triple, negative_triples], curr_rel