aliciafritz / Lazy-LinkingIn

CAS 502: Project Team 5 Group Assignment
MIT License
0 stars 1 forks source link

Add New Feature: Network Analysis #1

Closed aliciafritz closed 6 months ago

aliciafritz commented 7 months ago

Network Analysis: Analyze the network structure to identify key influencers or clusters of connections.

willtbso commented 7 months ago

How will "key" be defined? By site posting activity? By number of followers?

aliciafritz commented 7 months ago

I think the Python package we will use for this would be NetworkX, which is focused on network analysis and graph theory.

command to install the package: $ pip install networkx Link to GitHub for this package: https://github.com/networkx/networkx There is an installation doc INSTALL.rst listed there *probably need to use pandas too

Example of very basic use for the package:

import networkx import pandas import matplotlib.pyplot

Create a graph

G = nx.Graph()

Add nodes

G.add_nodes_from([1, 2, 3, 4])

Add edges

G.add_edges_from([(1, 2), (2, 3), (3, 4), (4, 1)])

Visualize the graph

pos = nx.spring_layout(G) # Set layout for better visualization nx.draw(G, pos, with_labels=True, font_weight='bold', node_size=700, node_color='skyblue', font_color='black', font_size=10)

Display the graph

plt.show()

willtbso commented 7 months ago

If we show the network structure and make the primary view the number of connections each of our connections has, we would focus on those of our connections that are most connected. We could just set a threshold number, i.e. include those connections with more than 500 connections, or we could do the top 10 or 20 regardless of what the numbers end up being.

willtbso commented 7 months ago

Previous idea of connections of connections is not viable in this iteration due to inaccessibility of data from LinkedIn. We can, however, conduct network analysis and visualization by looking at the companies connections work at and the job titles connections have

aliciafritz commented 6 months ago

Version 1 of this feature is complete