Datasets:
metadata dict | network-type string | nodes list | edges list | incidences list |
|---|---|---|---|---|
{
"dataset_name": "daqh/contact-primary-school"
} | undirected | [{"attrs":{"eigsh":[-0.087635846857688,-0.04524581118037803,0.11153718967659451,0.03807763071424255,(...TRUNCATED) | [{"attrs":{"eigsh":[-0.009880670430187333,-0.0018824316368977613,-0.01549160329352019,-0.00065763089(...TRUNCATED) | [{"edge":0,"node":8},{"edge":0,"node":140},{"edge":0,"node":144},{"edge":1,"node":217},{"edge":1,"no(...TRUNCATED) |
contact-primary-school
Zenodo | Cornell | Source Paper
contact-primary-school is an undirected hypergraph derived from high-resolution face-to-face proximity data collected via wearable sensors in a primary school. The underlying measurements record who was in close-range contact every 20 seconds, and this dataset converts each time window into a higher-order interaction by creating a hyperedge for each group of individuals simultaneously in proximity (commonly taken as the maximal clique of contacts in that interval), with nodes representing students and teachers.
Usage
dataset = load_dataset("daqh/contact-primary-school", split="full")
hypergraphs = [xgi.from_hif_dict(d, nodetype=int, edgetype=int) for d in dataset]
Statistics
|
|
|
|
Content
The hypergraph is stored in HIF (Hypergraph Interchange Format) as a JSON object, following the schema used to exchange higher-order network data across tools. Concretely, the dataset provides the canonical HIF fields-network-type, metadata, nodes, edges, and incidences-so you can reconstruct the full incidence structure without additional processing.
In addition to the raw hypergraph topology, vector features are provided for both nodes and hyperedges (in their attribute dictionaries), enabling out-of-the-box experimentation with representation learning and downstream tasks:
- Spectral features: eigenvectors of the (hypergraph) Laplacian (computed via sparse eigensolvers).
- Node2Vec embeddings: random-walk–based structural embeddings.
- VilLain embeddings: self-supervised hypergraph representation learning via virtual label propagation.
Basic statistics (as packaged here): 242 nodes, 12,704 hyperedges, 1 connected component.
Citation
@article{Benson-2018-simplicial,
author = {Benson, Austin R. and Abebe, Rediet and Schaub, Michael T. and Jadbabaie, Ali and Kleinberg, Jon},
title = {Simplicial closure and higher-order link prediction},
year = {2018},
doi = {10.1073/pnas.1800683115},
publisher = {National Academy of Sciences},
issn = {0027-8424},
journal = {Proceedings of the National Academy of Sciences}
}
- Downloads last month
- 92