-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathhawkes_datahandler.py
More file actions
128 lines (112 loc) · 5.01 KB
/
hawkes_datahandler.py
File metadata and controls
128 lines (112 loc) · 5.01 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
import collections
import datetime
import logging
import math
import numpy as np
import os
import pickle
import time
from datetime import datetime
class DataHandler:
def __init__(self, dataset_path, use_day, min_time):
# LOAD DATASET
self.dataset_path = dataset_path
print("Loading dataset")
load_time = time.time()
dataset = pickle.load(open(self.dataset_path, 'rb'))
print("|- dataset loaded in", str(time.time()-load_time), "s")
self.trainset = dataset['trainset']
self.testset = dataset['testset']
self.train_session_lengths = dataset['train_session_lengths']
self.test_session_lengths = dataset['test_session_lengths']
self.num_users = len(self.trainset)
if len(self.trainset) != len(self.testset):
raise Exception("""Testset and trainset have different
amount of users.""")
self.use_day = use_day
self.time_factor = 24 if self.use_day else 1
self.min_time = min_time/self.time_factor
self.max_time = 500/self.time_factor
self.divident = 3600*self.time_factor
self.user_gap_indices = {}
self.split_indices = {}
self.new_init_user_times()
def new_init_user_times(self):
self.user_times = [None]*self.num_users
self.max_time = 500/self.time_factor
upper_val = self.max_time + 0.01
for k in self.trainset.keys():
time = 0
times = [0]
train = self.trainset[k]
for session_index in range(1,len(train)):
gap = (train[session_index][0][0]-train[session_index-1][self.train_session_lengths[k][session_index-1]][0])/self.divident
if(gap > self.min_time):
time += min(gap, upper_val)
times.append(time)
test = self.testset[k]
self.split_indices[k] = len(times)
if(len(train) > 0 and len(test) > 0):
gap = (test[0][0][0]-train[-1][self.train_session_lengths[k][-1]][0])/self.divident
if(gap > self.min_time):
time += min(gap, upper_val)
times.append(time)
for session_index in range(1,len(test)):
gap = (test[session_index][0][0]-test[session_index-1][self.test_session_lengths[k][session_index-1]][0])/self.divident
if(gap > self.min_time):
time += min(gap, upper_val)
times.append(time)
self.user_times[k] = times
def init_user_times(self):
self.user_times = [None]*self.num_users
self.max_time = 500/self.time_factor
for k in self.trainset.keys():
train = self.trainset[k]
if(len(train) > 0):
times = [train[0][0][0]/self.divident]
else:
times = []
for session_index in range(1,len(train)):
gap = (train[session_index][0][0]-train[session_index-1][self.train_session_lengths[k][session_index-1]][0])/self.divident
if(gap > self.min_time):
times.append(train[session_index][0][0]/self.divident)
test = self.testset[k]
if(len(train) > 0 and len(test) > 0):
gap = (test[0][0][0]-train[-1][self.train_session_lengths[k][-1]][0])/self.divident
if(gap > self.min_time):
times.append(test[0][0][0]/self.divident)
for session_index in range(1,len(test)):
gap = (test[session_index][0][0]-test[session_index-1][self.test_session_lengths[k][session_index-1]][0])/self.divident
if(gap > self.min_time):
times.append(test[session_index][0][0]/self.divident)
self.user_times[k] = times
self.remove_long_gaps(k)
def remove_long_gaps(self, k):
split_index = len(self.trainset[k])
long_gap_indices = []
discrepencies = []
for i in range(len(self.user_times[k])-1):
if(self.user_times[k][i+1]-self.user_times[k][i] > self.max_time):
long_gap_indices.append(i)
discrepencies.append((self.user_times[k][i+1]-self.user_times[k][i])-self.max_time)
if i <= split_index:
split_index -= 1
remove = sum(discrepencies)
index = len(long_gap_indices)-1
if(index > 0):
for i in range(len(self.user_times[k])-1,0,-1):
if(i == long_gap_indices[index]):
remove -= discrepencies[index]
if(index != 0):
index -= 1
self.user_times[k][i] = self.user_times[k][i]-remove
gaps = np.array(long_gap_indices)
gaps = gaps+1
self.user_gap_indices[k] = gaps
self.split_indices[k] = split_index
def get_times(self):
return self.user_times
def get_gaps(self):
return self.user_gap_indices
def get_split_indices(self):
return self.split_indices