Scribd
Upload
498 views

Assignment 1 - Applied Social Network Analysis in Python

This document contains instructions for an assignment analyzing employee movie preferences and relationships using NetworkX and Pandas. It provides sample code to: 1. Load a bipartite graph from employee-movie choice data into a NetworkX graph. 2. Add node attributes to the graph to identify employees and movies. 3. Calculate a weighted projection of the graph to find the number of movies common to employee pairs. 4. Find the Pearson correlation between employee relationship scores and common movie counts.

Uploaded by

olivier.rachoin
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
498 views

Assignment 1 - Applied Social Network Analysis in Python

This document contains instructions for an assignment analyzing employee movie preferences and relationships using NetworkX and Pandas. It provides sample code to: 1. Load a bipartite graph from employee-movie choice data into a NetworkX graph. 2. Add node attributes to the graph to identify employees and movies. 3. Calculate a weighted projection of the graph to find the number of movies common to employee pairs. 4. Find the Pearson correlation between employee relationship scores and common movie counts.

Uploaded by

olivier.rachoin
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment 1

September 6, 2020

You are currently looking at version 1.1 of this notebook. To download notebooks and datafiles, as well
as get help on Jupyter notebooks in the Coursera platform, visit the Jupyter Notebook FAQ course resource.

1 Assignment 1 - Creating and Manipulating Graphs


Eight employees at a small company were asked to choose 3 movies that they would most
enjoy watching for the upcoming company movie night. These choices are stored in the file
Employee_Movie_Choices.txt.
A second file, Employee_Relationships.txt, has data on the relationships between different
coworkers.
The relationship score has value of -100 (Enemies) to +100 (Best Friends). A value of zero
means the two employees haven’t interacted or are indifferent.
Both files are tab delimited.

In [2]: import networkx as nx


import pandas as pd
import numpy as np
from networkx.algorithms import bipartite

# This is the set of employees


employees = set(['Pablo',
'Lee',
'Georgia',
'Vincent',
'Andy',
'Frida',
'Joan',
'Claude'])

# This is the set of movies


movies = set(['The Shawshank Redemption',
'Forrest Gump',

1
'The Matrix',
'Anaconda',
'The Social Network',
'The Godfather',
'Monty Python and the Holy Grail',
'Snakes on a Plane',
'Kung Fu Panda',
'The Dark Knight',
'Mean Girls'])

# you can use the following function to plot graphs


# make sure to comment it out before submitting to the autograder
def plot_graph(G, weight_name=None):
'''
G: a networkx G
weight_name: name of the attribute for plotting edge weights (if G is weighted)
'''
%matplotlib notebook
import matplotlib.pyplot as plt

plt.figure()
pos = nx.spring_layout(G)
edges = G.edges()
weights = None

if weight_name:
weights = [int(G[u][v][weight_name]) for u,v in edges]
labels = nx.get_edge_attributes(G,weight_name)
nx.draw_networkx_edge_labels(G,pos,edge_labels=labels)
nx.draw_networkx(G, pos, edges=edges, width=weights);
else:
nx.draw_networkx(G, pos, edges=edges);

1.0.1 Question 1
Using NetworkX, load in the bipartite graph from Employee_Movie_Choices.txt and return that
graph.
This function should return a networkx graph with 19 nodes and 24 edges

In [4]: import networkx as nx


from networkx.algorithms import bipartite
def answer_one():
G = nx.read_edgelist('Employee_Movie_Choices.txt', delimiter="\t")

return G
#answer_one()

2
1.0.2 Question 2
Using the graph from the previous question, add nodes attributes named 'type' where movies
have the value 'movie' and employees have the value 'employee' and return that graph.
This function should return a networkx graph with node attributes {'type': 'movie'} or {'type':
'employee'}

In [5]: def answer_two():


G = answer_one()

for node in G.nodes():


if node in employees:
G.add_node(node, type="employee")
else:
G.add_node(node, type="movie")

return G
#answer_two()

1.0.3 Question 3
Find a weighted projection of the graph from answer_two which tells us how many movies differ-
ent pairs of employees have in common.
This function should return a weighted projected graph.

In [6]: def answer_three():

B = answer_two()
weighted_projection = bipartite.weighted_projected_graph(B, employees)

return weighted_projection
#answer_three()

1.0.4 Question 4
Suppose you’d like to find out if people that have a high relationship score also like the same types
of movies.
Find the Pearson correlation ( using DataFrame.corr() ) between employee relationship scores
and the number of movies they have in common. If two employees have no movies in common it
should be treated as a 0, not a missing value, and should be included in the correlation calculation.
This function should return a float.

In [13]: def answer_four():

Rel = nx.read_edgelist('Employee_Relationships.txt', data=[('relationship_score', i


Rel_df = pd.DataFrame(Rel.edges(data=True), columns=['From', 'To', 'relationship_sc
# print (Rel_df)
G = answer_three()
G_df = pd.DataFrame(G.edges(data=True), columns=['From', 'To', 'movies_score'])

3
# print (G_df)
G_copy_df = G_df.copy()
# change the edge direction and get a double direction graph
G_copy_df.rename(columns={"From":"From_", "To":"From"}, inplace=True)
G_copy_df.rename(columns={"From_":"To"}, inplace=True)
# print (G_copy_df)
G_final_df = pd.concat([G_df, G_copy_df])
# print (G_final_df)
final_df = pd.merge(G_final_df, Rel_df, on = ['From', 'To'], how='right')
final_df['movies_score'] = final_df['movies_score'].map(lambda x: x['weight'] if ty
final_df['relationship_score'] = final_df['relationship_score'].map(lambda x: x['re
final_df['movies_score'].fillna(value=0, inplace=True)
# print (final_df)

return final_df['movies_score'].corr(final_df['relationship_score'])
answer_four()

Out[13]: 0.78839622217334737

You might also like