logo Netzschleuder network catalog, repository, and centrifuge

mind_news — MIND news clicks of Microsoft News users (2019)

Description

Bipartite networks of the users and news articles of the Microsoft News website, from the large version of the MIND data set (Microsoft News Dataset), compiled by Wu et al. from the anonymized behavior logs of Microsoft News. One million users who had clicked at least five news articles in the six weeks from October 12 to November 22, 2019 were sampled at random, and their ids were replaced by anonymous ones. The logs of the users consist of impressions: each impression is a list of news articles that were shown to a user at some time, with the ones that the user clicked marked. The impressions of November 9 to 14 form the training set of the data set, those of November 15 the validation set, and those of November 16 to 22 the test set, for which the clicks are not given. Each impression also comes with the click history of the user, the articles the user clicked before (in the first four weeks, from October 12 to November 8), without their times. The data set contains 4,979,946 impressions of 876,956 users and 130,379 news articles.

  • clicks: an edge connects a user to a news article that the user clicked: once for each click in an impression of the training or validation set (3,958,501 clicks, with their times), and once for each article in the user's click history (18,131,836 pairs, without times; the histories given with the impressions of a user were merged, keeping each user-article pair once).
  • impressions: an edge connects a user to a news article for each time the article was shown to the user in an impression (190,707,932 in all), with whether the user clicked it (unknown for the test set).

Both networks contain all the users and all the news articles of the data set. Left out are the abstracts of the articles and the entities (linked to Wikidata) recognized in their titles and abstracts, with their embeddings, as well as the smaller versions of the data set (MIND-small, a sample of 50,000 of the users, and MIND-demo), which are subsets of this one.

The networks have the following properties:

  • (Node) is_user: whether the node is a user (otherwise a news article).
  • (Node) name: the anonymized id of the user, or the id of the news article in the data set.
  • (Node) category, subcategory (news articles): the category and subcategory of the article on Microsoft News (empty for users).
  • (Node) title (news articles): the title of the article (empty for users).
  • (Node) url (news articles): the address of the article at the time of the release of the data set (empty for users).
  • (Edge) time: the time of the impression, as Unix time (the times are given without a time zone, and taken here as UTC; -1 for the click histories).
  • (Edge) impression: the number of the impression within its set (-1 for the click histories).
  • (Edge) split: the set of the impression: 0 for training, 1 for validation, 2 for test (-1 for the click histories).
  • (Edge) clicked (impressions): 1 if the user clicked the article, 0 if not, -1 if unknown (test set).
Tags
Social Online Informational Preferences Unweighted Multigraph Timestamps Metadata
Added
2026-10-28
Citation
  • F. Wu, Y. Qiao, J.-H. Chen, C. Wu, T. Qi, J. Lian, D. Liu, X. Xie, J. Gao, W. Wu, M. Zhou, "MIND: A Large-scale Dataset for News Recommendation." Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics (ACL), 3597-3606 (2020) 10.18653/v1/2020.acl-main.331 Sci-Hub
Upstream URL OK
https://msnews.github.io/
https://huggingface.co/datasets/Recommenders/MIND
Upstream license
Restricted access. Upstream does not permit data redistribution, hence the network files cannot be downloaded without authorization. See here how to gain access.
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
clicks 1,007,335 22,090,337 43.86 493.35 614.83 5.86 -0.17 0.00 8 0.96 Undirected Bipartite is_user name category subcategory title url time impression split 66.9 MiB 137.0 MiB 128.9 MiB 127.3 MiB
impressions 1,007,335 190,707,932 378.64 3710.26 4620.30 15.15 -0.39 0.00 8 0.92 Undirected Bipartite is_user name category subcategory title url time impression split clicked 372.1 MiB 970.5 MiB 922.1 MiB 858.0 MiB