logo Netzschleuder network catalog, repository, and centrifuge

wikispeedia — Wikispeedia hyperlinks and human navigation paths (2008-2014)

Description

Hyperlinks between the articles of a condensed version of the English Wikipedia (the 2007 Wikipedia for Schools, 4,604 articles), and the paths along which people navigated them in the online game Wikispeedia, collected by R. West and collaborators. In the game, a player is given a source and a target article and has to reach the target by clicking only on the links of the articles, as fast as possible. The data contain 51,318 finished and 24,875 unfinished games, played between August 2008 and January 2014.

There are two networks, whose nodes are the same 4,604 articles:

  • links: the directed hyperlink network; an edge points from an article to an article it links to. 110 articles link to themselves (self-loops).
  • navigation: the directed network of the clicks made by the players, aggregated over all games, finished or not; an edge points from an article to an article the players went to from it by clicking a link, weighted by the number of such clicks. The players could also go back to the previous article (a "back click"); back clicks (33,468) are not edges, but they determine the article from which the next click is made. In 146 clicks, the players went along a link that is not in the hyperlink network.

Left out are the individual games: their (hashed) players, start times, durations, the difficulty ratings given by the players, and the reasons why unfinished games ended. The matrix of shortest-path distances provided with the data, which can be computed from the links network, is also left out. The targets of 29 unfinished games are not among the articles; they are not counted in targets.

The networks have the following properties:

  • name: the title of the article (with underscores instead of spaces, as given).
  • categories: the hierarchical categories of the article (e.g. "subject.Science.Biology"), as given (some articles have none).
  • navigation, vertex sources and targets: the number of games (finished or not) whose source and target was the article.
  • navigation, edge count: the number of clicks from one article to the other, in all games; count_finished, the number of those in finished games; is_link, whether the clicked link is in the links network.
Tags
Informational Web graph Weighted Metadata
Citation
  • R. West and J. Leskovec, "Human wayfinding in information networks." Proceedings of the 21st International Conference on World Wide Web (WWW), 619-628 (2012). 10.1145/2187836.2187920 Sci-Hub
  • R. West, J. Pineau, and D. Precup, "Wikispeedia: An Online Game for Inferring Semantic Distances between Concepts." Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 1598-1603 (2009). www.ijcai.org
Upstream URL OK
https://snap.stanford.edu/data/wikispeedia.html
https://dlab.epfl.ch/wikispeedia/play/
Networks
Tip: click on a column header to sort the list, or hover over it 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
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv
Ridiculograms*
* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.