imdb_movies_2005 — IMDb actor-movie network (2005)
- Description
A bipartite network of actors and the movies they appeared in, based on the Internet Movie Database (IMDb), released as the data set of the evolving-graph drawing competition of the 13th International Symposium on Graph Drawing (GD 2005). Nodes are movies and actors, and an edge connects each movie to each of its actors. The network has 428,440 movies and 896,308 actors, connected by 3,792,390 edges; 124,823 movies have no actors in the data (isolated nodes), and 9,927 edges are repeated (an actor listed more than once in the same movie, e.g. in several roles).
Vertex properties:
is_movie, which marks the movies (the remaining nodes are actors);name, the title of the movie or the name of the actor (titles are in the IMDb format, e.g. with leading articles moved to the end, as in "Matrix, The");year, the release year of the movie (0 for actors, or if unknown; a few movies have invalid values, such as 1 or 9006);genre, the genre of the movie ("not available" for actors, or if unknown).
- Tags
- Economic Employment Unweighted Multigraph Metadata
- Citation
-
- Graph Drawing Contest 2005, "Evolving-graph drawing competition: IMDb movie-actor graph." 13th International Symposium on Graph Drawing (GD 2005). mozart.diei.unipg.it
- Upstream URL OK
- https://mozart.diei.unipg.it/gdcontest/contest2005/gdevolving2005.html
- Networks
-
Tip: hover over a column header for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties