English

Sparse Dynamic Distribution Decomposition: Efficient Integration of Trajectory and Snapshot Time Series Data

Machine Learning 2020-06-12 v2 Machine Learning

Abstract

Dynamic Distribution Decomposition (DDD) was introduced in Taylor-King et. al. (PLOS Comp Biol, 2020) as a variation on Dynamic Mode Decomposition. In brief, by using basis functions over a continuous state space, DDD allows for the fitting of continuous-time Markov chains over these basis functions and as a result continuously maps between distributions. The number of parameters in DDD scales by the square of the number of basis functions; we reformulate the problem and restrict the method to compact basis functions which leads to the inference of sparse matrices only -- hence reducing the number of parameters. Finally, we demonstrate how DDD is suitable to integrate both trajectory time series (paired between subsequent time points) and snapshot time series (unpaired time points). Methods capable of integrating both scenarios are particularly relevant for the analysis of biomedical data, whereby studies observe population at fixed time points (snapshots) and individual patient journeys with repeated follow ups (trajectories).

Keywords

Cite

@article{arxiv.2006.05138,
  title  = {Sparse Dynamic Distribution Decomposition: Efficient Integration of Trajectory and Snapshot Time Series Data},
  author = {Jake P. Taylor-King and Cristian Regep and Jyothish Soman and Flawnson Tong and Catalina Cangea and Charlie Roberts},
  journal= {arXiv preprint arXiv:2006.05138},
  year   = {2020}
}

Comments

11 pages, 2 figures

R2 v1 2026-06-23T16:10:21.933Z