-
Notifications
You must be signed in to change notification settings - Fork 12
/
extract_cd.py
240 lines (207 loc) · 9.66 KB
/
extract_cd.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
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
# -*- coding: utf-8 -*-
"""
Extract the graphFile, userInflFile, trainingActionsFile and actionsFile for credit distribution model
"""
import igraph as ig
import time
import pandas as pd
import numpy as np
from datetime import datetime
def sort_papers(papers):
"""
# Sort MAG diffusion cascade, which is a list of papers and their authors, in the order the paper'sdate
"""
x =list(map(int,list(map(lambda x:x.split()[-1],papers))))
return [papers[i].strip() for i in np.argsort(x)]
def remove_duplicates(cascade_nodes,cascade_times):
"""
# Some tweets have more then one retweets from the same person
# Keep only the first retweet of that person
"""
duplicates = set([x for x in cascade_nodes if cascade_nodes.count(x)>1])
for d in duplicates:
to_remove = [v for v,b in enumerate(cascade_nodes) if b==d][1:]
cascade_nodes= [b for v,b in enumerate(cascade_nodes) if v not in to_remove]
cascade_times= [b for v,b in enumerate(cascade_times) if v not in to_remove]
return cascade_nodes, cascade_times
def run(fn,log):
print("Reading the network")
g = ig.Graph.Read_Ncol(fn+"/"+fn+"_network.txt")
#----- Initialize features
idx = 0
deleted_nodes = []
g.vs["Cascades_started"] = 0
g.vs["Cumsize_cascades_started"] = 0
g.vs["Cascades_participated"] = 0
g.es["Inf"] = 0
g.es["Dt"] = 0
start = time.time()
f = open(fn+"/train_cascades.txt","r")
if(fn=="mag"):
start_t = int(next(f))
idx=0
#------ actions and trainingactions file
actionfile = open(fn+"/cd/actionFile.txt","w")
train_actions = open(fn+"/cd/trainingActionsFile.txt","w")
#---------------------- Iterate through cascades to create the train set
not_found = 0
for line in f:
idx+=1
if(fn=="mag"):
parts = line.split(";")
initiators = parts[0].replace(",","").split(" ")
op_time = int(initiators[-1])+start_t
initiators = initiators[:-1]
papers = parts[1].replace("\n","").split(":")
papers = sort_papers(papers)
papers = [list(map(lambda x: x.replace(",",""),i)) for i in list(map(lambda x:x.split(" "),papers))]
#---- Extract the authors from the paper list
flatten = []
for i in papers:
flatten = flatten+i[:-1]
u,i = np.unique(flatten,return_index=True)
cascade_nodes = list(u[np.argsort(i)])
#--- Update metrics of initiators
for op_id in initiators:
actionfile.write(op_id+" "+str(idx)+" "+str(op_time)+"\n")
try:
g.vs.find(name=op_id)["Cascades_started"]+=1
g.vs.find(name=op_id)["Cumsize_cascades_started"]+=len(papers)
except:
continue
cascade_times = []
cascade_nodes = []
for p in papers:
tim = int(p[-1])+start_t
for j in p[:-1]:
if j!="" and j!=" " and j not in cascade_nodes:
try:
g.vs.find(name=j)["Cascades_participated"]+=1
except:
continue
cascade_nodes.append(j)
cascade_times.append(tim)
#--- store action file
actionfile.write(j+" "+str(idx)+" "+str(tim)+"\n")
train_actions.write(str(idx)+"\n")
#--- Draw edges between initiators and the rest
for i in initiators:
for j in range(0,len(cascade_nodes)):
try:
#------ i is co author with cascade_nodes[j]
edge = g.get_eid(cascade_nodes[j],i)
#------ i influences j
#------ add to the graph edge attributes
g.es[edge]["Inf"]+=1
g.es[edge]["Dt"]+= (cascade_times[j]-op_time)
except:
continue
#--- Draw edges between cascade nodes
idx_of_node = 0;
for p in range(0,len(papers)):
for i in range(0,len(papers[p])):
#---- Draw edges to the authors from the subsequent papers
for p2 in range(p+1,len(papers)):
for j in range(0,len(papers[p2])):
try:
#------ i is followed by j
edge = g.get_eid(papers[p2][j],papers[p][i])
#------ i influences j
#------ add to the graph edge attributes
g.es[edge]["Inf"]+=1
#np.where(cascade_nodes==papers[p][j])
idx_of_node2 = idx_of_node+(len(papers[p])-i)+j
g.es[edge]["Dt"]+= (cascade_times[idx_of_node2]-cascade_times[idx_of_node])
except:
continue
idx_of_node+=1
else:
initiators = []
cascade = line.replace("\n","").split(";")
cascade_nodes = list(map(lambda x: x.split(" ")[0],cascade[1:]))
if(fn=="weibo"):
cascade_times = list(map(lambda x: int(( (datetime.strptime(x.replace("\r","").split(" ")[1], '%Y-%m-%d-%H:%M:%S')-datetime.strptime("2011-10-28", "%Y-%m-%d")).total_seconds())),cascade[1:]))
else:
cascade_times = list(map(lambda x: int(x.replace("\r","").split(" ")[1]),cascade[1:]))
#---- Remove retweets by the same person in one cascade
cascade_nodes, cascade_times = remove_duplicates(cascade_nodes,cascade_times)
#---------- Dictionary nodes -> cascades
op_id = cascade_nodes[0]
#--- store action files
for i in range(0,len(cascade_nodes)):
actionfile.write(cascade_nodes[i]+" "+str(idx)+" "+str(cascade_times[i])+"\n")
train_actions.write(str(idx)+"\n")
#---------- Update metrics
try:
g.vs.find(name=op_id)["Cascades_started"]+=1
g.vs.find(op_id)["Cumsize_cascades_started"]+=len(cascade_nodes)
except:
deleted_nodes.append(op_id)
continue
if(len(cascade_nodes)<2):
continue
for i in cascade_nodes[1:]:
try:
g.vs.find(name=i)["Cascades_participated"]+=1
except:
continue
#---- Data-based weighing
for i in range(0,len(cascade_nodes)):
# if it takes more than 15 mins, go away)
#--- Add to the propagation graph all i's edges that point to j
for j in range(i+1,len(cascade_nodes)):
try:
#------ i is followed by j
edge = g.get_eid(cascade_nodes[j],cascade_nodes[i])
#------ add to the graph edge attributes
g.es[edge]["Inf"]+=1
g.es[edge]["Dt"]+= (cascade_times[j]-cascade_times[i])
except:
not_found+=1
continue
if(idx%1000==0):
print("-------------------",idx)
actionfile.close()
train_actions.close()
print("Number of nodes not found in the graph: ",len(deleted_nodes))
print("Number of edges not found in the graph: ",not_found)
f.close()
total_cascades = [sum(x) for x in zip(g.vs["Cascades_started"], g.vs["Cascades_participated"])]
#------ user influence file
userInf = pd.DataFrame({"Node":g.vs["name"],
"Activity":total_cascades,
"Cascades_participated":g.vs["Cascades_participated"]})
userInf = userInf[userInf["Activity"]!=0]
userInf.to_csv(fn+"/cd/userInflFile.txt",index=False,header=False,sep=" ")
#------ graph file
db_w = open(fn+"/cd/net.csv","w")
# db weigthed network for simpath
for edge in g.es:
idx+=1
if(edge["Inf"]!=0):
#--------------- Node 2 has influence on Node 1
weight = int(edge["Dt"]/edge["Inf"])
db_w.write(str(g.vs[edge.tuple[1]]["name"])+" "+str(g.vs[edge.tuple[0]]["name"])+" "+str(weight)+"\n")
else:
db_w.write(str(g.vs[edge.tuple[1]]["name"])+" "+str(g.vs[edge.tuple[0]]["name"])+" 0"+"\n")
if(idx%1000000==0):
print("-------------------",idx)
db_w.close()
dat = pd.read_csv(fn+"/cd/net.csv",header=None,sep=" ")
dat.columns = ["n1","n2","w"]
dat['id'] = dat.apply(lambda x: '-'.join([str(j) for j in sorted([x['n1'],x['n2']])]),axis=1)
tmp = dat.drop(["n1","n2"],axis=1)
#215086-336224
idx = dat.duplicated(["id"],keep=False)
recip = dat[~idx]
#---- merge the reciprocal edges with the different weights
dat = dat[idx].drop_duplicates(['id'])
tmp = tmp[idx].drop_duplicates(['id'],keep="last")
d = dat.merge(tmp,on="id")
recip = recip.rename(columns = {"w":"w_x"})
recip["w_y"] = 0
dat = pd.concat([recip,d])
del dat["id"]
dat["ts"] = 0
dat.to_csv(fn+"/cd/graphFile.txt",index=False,header=False,sep=" ")
log.write("extract cd "+fn+" :"+str(time.time()-start)+"\n")