-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdata_iterator.py
More file actions
79 lines (69 loc) · 2.59 KB
/
data_iterator.py
File metadata and controls
79 lines (69 loc) · 2.59 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
import numpy
import json
import random
import numpy as np
class DataIterator:
def __init__(self, source,
batch_size=128,
maxlen=100,
train_flag=0
):
self.read(source)
self.users = list(self.users)
self.batch_size = batch_size
self.eval_batch_size = batch_size
self.train_flag = train_flag
self.maxlen = maxlen
self.index = 0
def __iter__(self):
return self
def next(self):
return self.__next__()
def read(self, source):
self.graph = {}
self.users = set()
self.items = set()
with open(source, 'r') as f:
for line in f:
conts = line.strip().split(',')
user_id = int(conts[0])
item_id = int(conts[1])
time_stamp = int(conts[2])
self.users.add(user_id)
self.items.add(item_id)
if user_id not in self.graph:
self.graph[user_id] = []
self.graph[user_id].append((item_id, time_stamp))
for user_id, value in self.graph.items():
value.sort(key=lambda x: x[1])
self.graph[user_id] = [x[0] for x in value]
self.users = list(self.users)
self.items = list(self.items)
def __next__(self):
if self.train_flag == 0:
user_id_list = random.sample(self.users, self.batch_size)
else:
total_user = len(self.users)
if self.index >= total_user:
self.index = 0
raise StopIteration
user_id_list = self.users[self.index: self.index+self.eval_batch_size]
self.index += self.eval_batch_size
item_id_list = []
hist_item_list = []
hist_mask_list = []
for user_id in user_id_list:
item_list = self.graph[user_id]
if self.train_flag == 0:
k = random.choice(range(4, len(item_list)))
item_id_list.append(item_list[k])
else:
k = int(len(item_list) * 0.8)
item_id_list.append(item_list[k:])
if k >= self.maxlen:
hist_item_list.append(item_list[k-self.maxlen: k])
hist_mask_list.append([1.0] * self.maxlen)
else:
hist_item_list.append(item_list[:k] + [0] * (self.maxlen - k))
hist_mask_list.append([1.0] * k + [0.0] * (self.maxlen - k))
return (user_id_list, item_id_list), (hist_item_list, hist_mask_list)