mims-harvard/Raindrop
Graph Neural Networks for Irregular Time Series
Combines graph neural networks with temporal self-attention to model inter-sensor dependencies in irregularly sampled multivariate time series, using neural message passing where each sample is represented as a graph with sensors as nodes. The architecture generates observation embeddings that aggregate into sensor-level representations through attention mechanisms, enabling robust handling of missing sensors and variable sampling rates. Evaluated on clinical datasets (PhysioNet P19, P12) and activity monitoring (PAMAP2) with specialized settings including leave-sensor-out robustness testing.
219 stars. No commits in the last 6 months.
Stars
219
Forks
47
Language
Python
License
MIT
Category
Last pushed
Oct 04, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/embeddings/mims-harvard/Raindrop"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
eliorc/node2vec
Implementation of the node2vec algorithm.
ferencberes/online-node2vec
Node Embeddings in Dynamic Graphs
mims-harvard/nimfa
Nimfa: Nonnegative matrix factorization in Python
mims-harvard/decagon
Graph convolutional neural network for multirelational link prediction
claws-lab/jodie
A PyTorch implementation of ACM SIGKDD 2019 paper "Predicting Dynamic Embedding Trajectory in...