Skip to main content
Article
Approximate kernel reconstruction for time-varying networks
Biodata Mining (2019)
  • Gregory Ditzler, University of Arizona
  • Nidhal Bouaynaya, Rowan University
  • Roman Shterenberg, University of Alabama at Birmingham
  • Hassan M. Fathallah-Shaykh, University of Alabama at Birmingham
Abstract
Most existing algorithms for modeling and analyzing molecular networks assume a static or time-invariant network topology. Such view, however, does not render the temporal evolution of the underlying biological process as molecular networks are typically “re-wired” over time in response to cellular development and environmental changes. In our previous work, we formulated the inference of time-varying or dynamic networks as a tracking problem, where the target state is the ensemble of edges in the network. We used the Kalman filter to track the network topology over time. Unfortunately, the output of the Kalman filter does not reflect known properties of molecular networks, such as sparsity.
Publication Date
December 1, 2019
DOI
10.1186/s13040-019-0192-1
Publisher Statement
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Citation Information
Gregory Ditzler, Nidhal Bouaynaya, Roman Shterenberg and Hassan M. Fathallah-Shaykh. "Approximate kernel reconstruction for time-varying networks" Biodata Mining Vol. 12 Iss. 1 (2019) p. 1 - 14
Available at: http://works.bepress.com/nidhal-bouaynaya/34/
Creative Commons license
Creative Commons License
This work is licensed under a Creative Commons CC_BY International License.