Datasets:
ShimizuYuki
commited on
Commit
•
a1d36e0
1
Parent(s):
dd4d9ba
Update README.md
Browse files
README.md
CHANGED
@@ -30,25 +30,25 @@ This dataset consists of three subsets, hero_hero_comic.csv, adjacency_list.csv
|
|
30 |
|
31 |
## Uses
|
32 |
|
33 |
-
Network Topology Analysis
|
34 |
Just like what the original work did, we can try to analyze the network topology to discover whether the interpersonal relationships and social structures created in novels conform to real-world social networks, whether they fit the small-world model; we can also use this to infer the core heroes of the Marvel Universe, etc.
|
35 |
|
36 |
-
Community Detection
|
37 |
This is an excellent toy model for applying community detection algorithms, and we naturally have clear community outcomes such as the "Avengers Alliance" for comparison.
|
38 |
|
39 |
-
Link Prediction, Attack Robustness, etc
|
40 |
In fact, all algorithms effective for conventional network models can be transferred and applied to this network, including but not limited to: link prediction: which predicts which heroes might collaborate in future works; attack robustness: studying whether Thanos's snap would damage the hero ecosystem of the entire Marvel Universe; word2vec: assigning network structural features, finding heroes paires like Spider-Man and Venom...
|
41 |
|
42 |
|
43 |
## Dataset Structure
|
44 |
|
45 |
-
hero_hero_comic.csv
|
46 |
A table three columns hero1[str], hero2[str] and comic[str]. hero1 and hero2 shows together in a same comic, which is the comic in the third colunm.
|
47 |
|
48 |
-
adjacency_list.csv
|
49 |
A table contains three columns hero1[str], hero2[str] and counts[int], which is the total times hero1 and hero2 shows together in a comic.
|
50 |
|
51 |
-
adjacency_matrix.csv
|
52 |
A matrix contains 6267 columns times 6267 rows, each cell with an [int] value. Each row/column represents a hero, each nondiagonal cell represents the total times the colunm hero and the row hero shows in a same comic and each diagonal cell represents the total counts of the colunm(row) hero in this dataset.
|
53 |
|
54 |
## Source Data
|
|
|
30 |
|
31 |
## Uses
|
32 |
|
33 |
+
**Network Topology Analysis,**
|
34 |
Just like what the original work did, we can try to analyze the network topology to discover whether the interpersonal relationships and social structures created in novels conform to real-world social networks, whether they fit the small-world model; we can also use this to infer the core heroes of the Marvel Universe, etc.
|
35 |
|
36 |
+
**Community Detection,**
|
37 |
This is an excellent toy model for applying community detection algorithms, and we naturally have clear community outcomes such as the "Avengers Alliance" for comparison.
|
38 |
|
39 |
+
**Link Prediction, Attack Robustness, etc.**
|
40 |
In fact, all algorithms effective for conventional network models can be transferred and applied to this network, including but not limited to: link prediction: which predicts which heroes might collaborate in future works; attack robustness: studying whether Thanos's snap would damage the hero ecosystem of the entire Marvel Universe; word2vec: assigning network structural features, finding heroes paires like Spider-Man and Venom...
|
41 |
|
42 |
|
43 |
## Dataset Structure
|
44 |
|
45 |
+
**hero_hero_comic.csv:**
|
46 |
A table three columns hero1[str], hero2[str] and comic[str]. hero1 and hero2 shows together in a same comic, which is the comic in the third colunm.
|
47 |
|
48 |
+
**adjacency_list.csv:**
|
49 |
A table contains three columns hero1[str], hero2[str] and counts[int], which is the total times hero1 and hero2 shows together in a comic.
|
50 |
|
51 |
+
**adjacency_matrix.csv:**
|
52 |
A matrix contains 6267 columns times 6267 rows, each cell with an [int] value. Each row/column represents a hero, each nondiagonal cell represents the total times the colunm hero and the row hero shows in a same comic and each diagonal cell represents the total counts of the colunm(row) hero in this dataset.
|
53 |
|
54 |
## Source Data
|