Team Member: @Yixuan Li, @Ziang Zhou, @Jincheng He
This is my last assignment before graduation, my role is crawling data and do network analysis and visualization. Happy graduation!
Code in marvel/ directory is referenced from here.
In this graph, we visualized the network of marvel characters connection. Each node in this graph is a character, and the edge between two nodes represents these two characters have a connection. Here the definition of two characters having the connection is that these two characters both appear in at least one certain event. The weight of the edge is the number of events that these two characters both appear.
To better visualize the graph and make it clearer, we randomized the edges of being showed. Originally there are 55256 edges, we chose the random rate to be 0.02, which means the graph only reveals 1105 edges.
By using this graph, we can compute different types of centrality such as betweenness centrality or closeness centrality.
[data] | [crawling code] | [visualization code]