-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathfaculty.py
More file actions
481 lines (363 loc) · 16.8 KB
/
faculty.py
File metadata and controls
481 lines (363 loc) · 16.8 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
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
import csv
import operator
import networkx as nx
import matplotlib.pyplot as plt
import numpy
import pandas as pd
from preprocess import fetch_faculty, getHire
from tqdm import tqdm
FACULTY, NAMES = fetch_faculty()
class Year:
'''
Builds a Collaboration Network for the individual years
'''
def __init__(self, year):
global NAMES
global FACULTY
self.year = year
self.graph_year = nx.Graph()
self.graph_previous_years = nx.Graph()
self.year_info = {}
self.previous_year_info = {}
self.build_graph()
self.set_information()
self.add_properties_network()
def build_graph(self):
self.graph_year.add_nodes_from(NAMES)
self.graph_previous_years.add_nodes_from(NAMES)
for faculty in FACULTY:
for paper in FACULTY[faculty].papers:
if (paper.year <= self.year) and (paper.year > 1999):
for author in paper.authors:
if (author in NAMES) and (author != FACULTY[faculty].name) and not(self.graph_previous_years.has_edge(FACULTY[faculty].name, author)) and not(self.graph_previous_years.has_edge(author, FACULTY[faculty].name)):
self.graph_previous_years.add_edge(FACULTY[faculty].name, author)
if paper.year == self.year:
self.graph_year.add_edge(FACULTY[faculty].name, author)
return
def set_information(self):
def get_info(network, network_dic):
def get_average_degree(network):
degrees = [i[1] for i in (network.degree())]
degrees = sum(degrees)
avg_degree = degrees/(network.number_of_nodes())
return round(avg_degree,2)
def get_average_clustering(network):
return round(nx.average_clustering(network),2)
def get_global_clustering(network):
d = nx.clustering(network)
temp = dict(sorted(d.items(), key=operator.itemgetter(1),reverse=True))
return temp
def get_number_edges(network):
'''
Returns the number of edges in the network
'''
return network.number_of_edges()
def get_connected_components(network):
connected_components = nx.connected_components(network)
num = 0
connected_components_list = []
for i in connected_components :
if len(i) > 1 :
num += 1
temp = network.subgraph(list(i)).copy()
connected_components_list.append(temp)
return num, connected_components_list
def get_dist(network):
average=[]
for C in (network.subgraph(c).copy() for c in nx.connected_components(network)):
average.append(nx.average_shortest_path_length(C))
dist_connected=[]
for i in range(len(average)):
if average[i] != 0:
dist_connected.append(round(average[i],2))
dist_connected = sorted(dist_connected, reverse=True)
dist_connected = [str(element) for element in dist_connected]
dist_connected = ", ".join(dist_connected)
return dist_connected
def get_smallworld_sigma(network):
for C in (network.subgraph(c).copy() for c in nx.connected_components(network)):
if len(C)>3:
sigma=nx.sigma(C, niter=1, nrand=1, seed=0)
print(sigma)
def get_most_edge_faculty(network):
return sorted(network.degree, key=lambda x: x[1], reverse=True)
def get_density(network):
return round(nx.density(network),2)
def get_degree_correlation_coefficient(network):
return nx.degree_pearson_correlation_coefficient(network)
network_dic['average_degree']=get_average_degree(network)
network_dic['average_clustering_coefficient']=get_average_clustering(network)
network_dic['number_of_edges'] = get_number_edges(network)
network_dic['number_of_connected_components'], network_dic['connected_components'] = get_connected_components(network)
network_dic['avg_dist'] = get_dist(network)
network_dic['most_edge_faculty'] = get_most_edge_faculty(network)
network_dic['density'] = get_density(network)
network_dic['global_clustering'] = get_global_clustering(network)
network_dic['degree_correlation_coefficient'] = get_degree_correlation_coefficient(network)
get_info(self.graph_year,self.year_info)
get_info(self.graph_previous_years,self.previous_year_info)
return
def display_networkx(self):
'''
Displays the network_x graph
'''
plt.figure(figsize=(24, 12))
nx.draw_random(self.graph_year, with_labels=True, font_weight='bold')
plt.show()
return
def add_properties_network(self):
def get_graph_properties(network):
degrees = dict(nx.degree(network))
betweenness_centrality = nx.betweenness_centrality(network, normalized=True)
eigenvector_centrality = nx.eigenvector_centrality(network, max_iter=600)
degree_centrality = nx.degree_centrality(network)
closeness_centrality = nx.closeness_centrality(network)
clustering = nx.clustering(network)
nx.set_node_attributes(network, name='degree', values=degrees)
nx.set_node_attributes(network, name='betweenness', values=betweenness_centrality)
nx.set_node_attributes(network, name='degree_centrality', values=degree_centrality)
nx.set_node_attributes(network, name='eigenvector_centrality', values=eigenvector_centrality)
nx.set_node_attributes(network, name='closeness_centrality', values=closeness_centrality)
nx.set_node_attributes(network, name='clustering', values=clustering)
number_to_adjust_by = 5
adjusted_node_size = dict([(node, degree+number_to_adjust_by) for node, degree in nx.degree(network)])
nx.set_node_attributes(network, name='adjusted_node_size', values=adjusted_node_size)
pos = nx.spring_layout(network, scale = 2)
for node in network.nodes:
network.nodes[node]['pos'] = list(pos[node])
return
get_graph_properties(self.graph_year)
get_graph_properties(self.graph_previous_years)
return
class Faculty:
def __init__(self, name, faculty_list):
self.name = name
self.faculty_list = faculty_list
self.graph_years_scse = {}
self.graph_years_all = {}
self.info = {}
self.generate_graph_years()
self.set_information()
def generate_graph_years(self):
def build_graph(year):
def set_color_nodes(g):
for i in g.nodes():
if i == self.name:
g.nodes[i]['color'] = "#0033cc"
elif i in self.faculty_list:
g.nodes[i]['color'] = "#99d6ff"
else:
g.nodes[i]['color'] = "#666666"
return
graph = nx.Graph()
graph_all = nx.Graph()
graph.add_nodes_from(pd.read_csv("Faculty.csv")['Faculty'].to_list())
for paper in FACULTY[self.name].papers:
if paper.year == year:
for author in paper.authors:
if (author != FACULTY[self.name].name) and not(graph.has_edge(FACULTY[self.name].name, author)) and not(graph.has_edge(author, FACULTY[self.name].name)):
graph_all.add_edge(FACULTY[self.name].name, author)
if (author in NAMES):
graph.add_edge( FACULTY[self.name].name, author)
set_color_nodes(graph)
set_color_nodes(graph_all)
self.graph_years_scse[year] = graph
self.graph_years_all[year] = graph_all
return
for i in range(2000,2022):
build_graph(i)
return
def set_information(self):
def getYear(year):
info = {}
#Number of collaborations within scse
info['scse_collaboration'] = self.graph_years_scse[year].number_of_edges()
#Number of collaborations in total
info['all_collaboration'] = self.graph_years_all[year].number_of_edges()
return info
for i in range(2000,2022):
self.info[i] = getYear(i)
return
class FacultySubset:
def __init__(self, names, year = None):
self.colour_coord = None
self.year = year
if type(names) != dict :
self.names = names
else:
self.names = names.keys()
self.colour_coord = names
self.graph_years = {}
self.graph_year_all = nx.Graph()
self.faculty = {}
self.generate_graph_years()
if self.colour_coord == None:
self.build_faculty()
else:
self.colour_based_position()
def colour_based_position(self):
for year in range(2000,2022):
g = self.graph_years[year]
for i in g.nodes():
if(i in self.colour_coord):
g.nodes[i]['color'] = self.colour_coord[i]
else:
g.nodes[i]['color'] = 'grey'
for i in self.graph_year_all.nodes():
if(i in self.colour_coord):
self.graph_year_all.nodes[i]['color'] = self.colour_coord[i]
else:
self.graph_year_all.nodes[i]['color']='grey'
return
def generate_graph_years(self):
def build_graph(year):
graph = nx.Graph()
graph_all = nx.Graph()
NAMES = pd.read_csv("Faculty.csv")['Faculty'].to_list()
graph.add_nodes_from(NAMES)
if year == 2021:
graph_all.add_nodes_from(NAMES)
for i in graph.nodes():
if i in self.names:
graph.nodes[i]['color'] = "#0033cc"
else:
graph.nodes[i]['color'] = "#666666"
for faculty in self.names:
for paper in FACULTY[faculty].papers:
for author in paper.authors:
if (author != faculty) and not(graph.has_edge(faculty, author)) and not(graph.has_edge(author,faculty)):
if (author in NAMES):
if paper.year == year:
graph.add_edge(faculty, author)
if year == 2021:
graph_all.add_edge(faculty,author)
degrees = dict(nx.degree(graph))
nx.set_node_attributes(graph, name='degree', values=degrees)
self.graph_years[year] = graph
if year == 2021:
degrees = dict(nx.degree(graph_all))
nx.set_node_attributes(graph_all, name='degree', values=degrees)
self.graph_year_all = graph_all
return
if self.year == None:
for i in tqdm(range(2000,2022)):
build_graph(i)
else:
build_graph(self.year)
return
def build_faculty(self):
for i in self.names:
self.faculty[i] = Faculty(i, self.names)
class ManageGraph:
def __init__(self):
self.faculty, self.names = FACULTY, NAMES
self.nodes=[]
self.edges=[]
for x in self.faculty:
if(self.faculty[x].managment=='Y'):
self.nodes.append(x)
p=self.faculty[x].papers
for y in p:
for a in y.authors:
if(a in self.names):
self.edges.append((x, a))
class PositionGraph:
def __init__(self, target):
faculty, names = FACULTY, NAMES
self.nodes=[]
self.edges=[]
for x in faculty:
if(faculty[x].position==target):
self.nodes.append(x)
for x in self.nodes:
p=faculty[x].papers
for y in p:
for a in y.authors:
if(a in self.nodes):
self.edges.append((x,a))
class ExcellenceGraph:
def __init__(self):
self.faculty, self.names = FACULTY, NAMES
self.nodes=[]
self.edges=[]
for x in self.faculty:
if(self.faculty[x].excellenceNode==True):
self.nodes.append(x)
class AreaGraph:
def __init__(self, area):
self.faculty, self.names = FACULTY, NAMES
self.nodes=[]
self.edges=[]
for x in self.faculty:
if(self.faculty[x].area==area):
self.nodes.append(x)
class Hire:
def __init__(self):
self.Hire = getHire()
self.l = []
self.graph = nx.Graph()
self.degree = None
self.excellence_order = None
self.generate_graph_years()
self.set_node_info(self.graph)
self.get_top()
self.copyNodeInfo()
def generate_graph_years(self):
print("Generating graphs")
for faculty in tqdm(self.Hire):
for paper in self.Hire[faculty].papers:
if (paper.year < 2021) and (paper.year > 2015):
for author in paper.authors:
if (author != self.Hire[faculty].name) and not(self.graph.has_edge(self.Hire[faculty].name, author)) and not(self.graph.has_edge(author, self.Hire[faculty].name)):
self.graph.add_edge(self.Hire[faculty].name, author)
self.graph.nodes[self.Hire[faculty].name]['excellent'] = self.Hire[faculty].excellenceNode
return
def set_node_info(self, network):
degrees = dict(nx.degree(network))
nx.set_node_attributes(network, name='degree', values=degrees)
self.degree = degrees
return
def get_top(self):
def sort_graph(sortValue):
l = []
temp = sorted(sortValue.items() , key=lambda x: x[1] , reverse=True)
sortValue = temp
for i in temp[:150]:
l.append(i[0])
return l
def build_graph(l):
g = nx.Graph()
for i in self.graph.edges():
if ((i[0] in l) and (i[1] in l)):
g.add_edge(i[0],i[1])
return g
def get_excellence_dictionary():
temp = {}
for i in self.graph.nodes():
try:
temp[i] = self.graph.nodes[i]['excellent']
except:
temp[i] = 0
return temp
self.excellence_order = get_excellence_dictionary()
self.degree_orderd = dict(nx.degree(self.graph))
self.excellence_order = {k: v for k, v in sorted(self.excellence_order.items(), key=lambda item: item[1], reverse=True)}
self.degree_orderd = {k: v for k, v in sorted(self.degree_orderd .items(), key=lambda item: item[1], reverse=True)}
degrees = sort_graph(self.degree_orderd)
orderBy = sort_graph(self.excellence_order)
self.graph_degree = build_graph(degrees)
self.graph_excellence = build_graph(orderBy)
return
def copyNodeInfo(self):
def setInfo(network):
for i in network.nodes():
network.nodes[i]['original_degree'] = self.graph.nodes[i]['degree']
network.nodes[i]['excellent'] = self.graph.nodes[i]['excellent']
if network.nodes[i]['excellent'] > 25:
network.nodes[i]['color'] = "#0033cc"
else:
network.nodes[i]['color'] = "black"
setInfo(self.graph_degree)
setInfo(self.graph_excellence)
self.set_node_info(self.graph_degree)
self.set_node_info(self.graph_excellence)