coauth-MAG-History

Overview This is a temporal higher-order network dataset, which here means a sequence of timestamped hyperedges where each hyperedge is a set of nodes. In this dataset, nodes are authors, and a hyperedge is a publication marked with the "History" tag in the Microsoft Academic Graph. Timestamps are the year of publication. We restricted to hyperedges containing at most 25 nodes. Statistics Some basic statistics of this dataset are: number of nodes: 1,014,734 number of timestamped hyperedges: 1,812,511 number of unique simplices: 895,668 Source of original data Source: coauth-MAG-History dataset References If you use this data, please cite the following papers: Simplicial closure and higher-order link prediction. Austin R. Benson, Rediet Abebe, Michael T. Schaub, Ali Jadbabaie, and Jon Kleinberg. Proceedings of the National Academy of Sciences (PNAS), 2018. An overview of Microsoft Academic Service (MAS) and applications. Arnab Sinha, Zhihong Shen, Yang Song, Hao Ma, Darrin Eide, Bo-June Hsu, and Kuansan Wang. Proceedings of WWW, 2015.# 数据集概览 本数据集为时序高阶网络数据集，即一系列带时间戳的超边序列，每条超边均为节点的集合。本数据集的节点为作者，超边则为微软学术图谱（Microsoft Academic Graph）中标记有"History"标签的学术论文，时间戳为论文的发表年份。我们对超边进行了限制，仅保留包含不超过25个节点的超边。 # 数据集统计信息 本数据集的基础统计指标如下： - 节点总数：1,014,734 - 带时间戳的超边总数：1,812,511 - 唯一单形（simplex）总数：895,668 # 原始数据来源 数据来源：coauth-MAG-History 数据集 # 引用说明 若使用本数据集，请引用以下论文： 1. 《Simplicial closure and higher-order link prediction》，作者：Austin R. Benson、Rediet Abebe、Michael T. Schaub、Ali Jadbabaie、Jon Kleinberg，发表于《美国国家科学院院刊（PNAS）》，2018年。 2. 《An overview of Microsoft Academic Service (MAS) and applications》，作者：Arnab Sinha、Zhihong Shen、Yang Song、Hao Ma、Darrin Eide、Bo-June Hsu、Kuansan Wang，发表于WWW会议论文集，2015年。