Kalman Filtering for Genetic Regulatory Networks with Missing Values.
Ontology highlight
ABSTRACT:
SUBMITTER: Lin Q
PROVIDER: S-EPMC5549500 | biostudies-other | 2017
REPOSITORIES: biostudies-other
Similar Datasets
Project description:An increasing interest in models for multivariate spatio-temporal processes has been noted in the last years. Some of these models are very flexible and can capture both marginal and cross spatial associations amongst the components of the multivariate process. In order to contribute to the statistical analysis of these models, this paper deals with the estimation and prediction of multivariate spatio-temporal processes by using multivariate state-space models. In this context, a multivariate spatio-temporal process is represented through the well-known Wold decomposition. Such an approach allows for an easy implementation of the Kalman filter to estimate linear temporal processes exhibiting both short and long range dependencies, together with a spatial correlation structure. We illustrate, through simulation experiments, that our method offers a good balance between statistical efficiency and computational complexity. Finally, we apply the method for the analysis of a bivariate dataset on average daily temperatures and maximum daily solar radiations from 21 meteorological stations located in a portion of south-central Chile.Supplementary informationThe online version contains supplementary material available at 10.1007/s00477-022-02266-3.
| S-EPMC9303052 | biostudies-literature
Project description:Internet of Things (IoT) projects are increasing in size over time, and some of them are growing to reach the whole world. Sensor arrays are deployed world-wide and their data is sent to the cloud, making use of the Internet. These huge networks can be used to improve the quality of life of the humanity by continuously monitoring many useful indicators, like the health of the users, the air quality or the population movements. Nevertheless, in this scalable context, a percentage of the sensor data readings can fail due to several reasons like sensor reliabilities, network quality of service or extreme weather conditions, among others. Moreover, sensors are not homogeneously replaced and readings from some areas can be more precise than others. In order to address this problem, in this paper we propose to use collaborative filtering techniques to predict missing readings, by making use of the whole set of collected data from the IoT network. State of the art recommender systems methods have been chosen to accomplish this task, and two real sensor array datasets and a synthetic dataset have been used to test this idea. Experiments have been carried out varying the percentage of failed sensors. Results show a good level of prediction accuracy which, as expected, decreases as the failure rate increases. Results also point out a failure rate threshold below which is better to make use of memory-based approaches, and above which is better to choose model-based methods.
| S-EPMC7472609 | biostudies-literature
Project description:Multivariate time series data in practical applications, such as health care, geoscience, and biology, are characterized by a variety of missing values. In time series prediction and other related tasks, it has been noted that missing values and their missing patterns are often correlated with the target labels, a.k.a., informative missingness. There is very limited work on exploiting the missing patterns for effective imputation and improving prediction performance. In this paper, we develop novel deep learning models, namely GRU-D, as one of the early attempts. GRU-D is based on Gated Recurrent Unit (GRU), a state-of-the-art recurrent neural network. It takes two representations of missing patterns, i.e., masking and time interval, and effectively incorporates them into a deep model architecture so that it not only captures the long-term temporal dependencies in time series, but also utilizes the missing patterns to achieve better prediction results. Experiments of time series classification tasks on real-world clinical datasets (MIMIC-III, PhysioNet) and synthetic datasets demonstrate that our models achieve state-of-the-art performance and provide useful insights for better understanding and utilization of missing values in time series analysis.
| S-EPMC5904216 | biostudies-literature
Project description:The development of new high-throughput technologies enables us to measure genome-wide transcription levels, protein abundance, metabolite concentration, etc. Nevertheless, these experimental data are often noisy and incomplete, which hinders data analysis, modeling and prediction. Here, we propose a method to predict expression values of genes involved in stable cellular phenotypes from the expression values of the remaining genes in a literature-based gene regulatory network. The consistency between predicted and known stable states from experimental data is used to guide an iterative network pruning that contextualizes the network to the biological conditions under which the expression data were obtained. Using the contextualized network and the property of network stability we predict gene expression values missing from experimental data. The prediction method assumes a Boolean model to compute steady states of networks and an evolutionary algorithm to iteratively prune the networks. The evolutionary algorithm samples the probability distribution of positive feedback loops or positive circuits and individual interactions within the subpopulation of the best-pruned networks at each iteration. The resulting expression inference is based not only on previous knowledge about local connectivity but also on a global network property (stability), providing robustness in the predictions.
| S-EPMC3592407 | biostudies-literature
Project description:RNA SHAPE experiments have become important and successful sources of information for RNA structure prediction. In such experiments, chemical reagents are used to probe RNA backbone flexibility at the nucleotide level, which in turn provides information on base pairing and therefore secondary structure. Little is known, however, about the statistics of such SHAPE data. In this work, we explore different representations of noise in SHAPE data and propose a statistically sound framework for extracting reliable reactivity information from multiple SHAPE replicates. Our analyses of RNA SHAPE experiments underscore that a normal noise model is not adequate to represent their data. We propose instead a log-normal representation of noise and discuss its relevance. Under this assumption, we observe that processing simulated SHAPE data by directly averaging different replicates leads to bias. Such bias can be reduced by analyzing the data following a log transformation, either by log-averaging or Kalman filtering. Application of Kalman filtering has the additional advantage that a prior on the nucleotide reactivities can be introduced. We show that the performance of Kalman filtering is then directly dependent on the quality of that prior. We conclude the paper with guidelines on signal processing of RNA SHAPE data.
| S-EPMC6248965 | biostudies-literature
Project description:MotivationConventional identification methods for gene regulatory networks (GRNs) have overwhelmingly adopted static topology models, which remains unchanged over time to represent the underlying molecular interactions of a biological system. However, GRNs are dynamic in response to physiological and environmental changes. Although there is a rich literature in modeling static or temporally invariant networks, how to systematically recover these temporally changing networks remains a major and significant pressing challenge. The purpose of this study is to suggest a two-step strategy that recovers time-varying GRNs.ResultsIt is suggested in this paper to utilize a switching auto-regressive model to describe the dynamics of time-varying GRNs, and a two-step strategy is proposed to recover the structure of time-varying GRNs. In the first step, the change points are detected by a Kalman-filter based method. The observed time series are divided into several segments using these detection results; and each time series segment belonging to two successive demarcating change points is associated with an individual static regulatory network. In the second step, conditional network structure identification methods are used to reconstruct the topology for each time interval. This two-step strategy efficiently decouples the change point detection problem and the topology inference problem. Simulation results show that the proposed strategy can detect the change points precisely and recover each individual topology structure effectively. Moreover, computation results with the developmental data of Drosophila Melanogaster show that the proposed change point detection procedure is also able to work effectively in real world applications and the change point estimation accuracy exceeds other existing approaches, which means the suggested strategy may also be helpful in solving actual GRN reconstruction problem.
| S-EPMC3792119 | biostudies-literature
Project description:The fidelity of the trajectories obtained from video-based particle tracking determines the success of a variety of biophysical techniques, including in situ single cell particle tracking and in vitro motility assays. However, the image acquisition process is complicated by system noise, which causes positioning error in the trajectories derived from image analysis. Here, we explore the possibility of reducing the positioning error by the application of a Kalman filter, a powerful algorithm to estimate the state of a linear dynamic system from noisy measurements. We show that the optimal Kalman filter parameters can be determined in an appropriate experimental setting, and that the Kalman filter can markedly reduce the positioning error while retaining the intrinsic fluctuations of the dynamic process. We believe the Kalman filter can potentially serve as a powerful tool to infer a trajectory of ultra-high fidelity from noisy images, revealing the details of dynamic cellular processes.
| S-EPMC2884229 | biostudies-literature
Project description:The problem of attitude estimation is broadly addressed using the Kalman filter formalism and unit quaternions to represent attitudes. This paper is also included in this framework, but introduces a new viewpoint from which the notions of "multiplicative update" and "covariance correction step" are conceived in a natural way. Concepts from manifold theory are used to define the moments of a distribution in a manifold. In particular, the mean and the covariance matrix of a distribution of unit quaternions are defined. Non-linear versions of the Kalman filter are developed applying these definitions. A simulation is designed to test the accuracy of the developed algorithms. The results of the simulation are analyzed and the best attitude estimator is selected according to the adopted performance metric.
| S-EPMC6339217 | biostudies-literature
Project description:The Kalman filter provides a simple and efficient algorithm to compute the posterior distribution for state-space models where both the latent state and measurement models are linear and gaussian. Extensions to the Kalman filter, including the extended and unscented Kalman filters, incorporate linearizations for models where the observation model p(observation|state) is nonlinear. We argue that in many cases, a model for p(state|observation) proves both easier to learn and more accurate for latent state estimation. Approximating p(state|observation) as gaussian leads to a new filtering algorithm, the discriminative Kalman filter (DKF), which can perform well even when p(observation|state) is highly nonlinear and/or nongaussian. The approximation, motivated by the Bernstein-von Mises theorem, improves as the dimensionality of the observations increases. The DKF has computational complexity similar to the Kalman filter, allowing it in some cases to perform much faster than particle filters with similar precision, while better accounting for nonlinear and nongaussian observation models than Kalman-based extensions. When the observation model must be learned from training data prior to filtering, off-the-shelf nonlinear and nonparametric regression techniques can provide a gaussian model for p(observation|state) that cleanly integrates with the DKF. As part of the BrainGate2 clinical trial, we successfully implemented gaussian process regression with the DKF framework in a brain-computer interface to provide real-time, closed-loop cursor control to a person with a complete spinal cord injury. In this letter, we explore the theory underlying the DKF, exhibit some illustrative examples, and outline potential extensions.
| S-EPMC8259355 | biostudies-literature
Project description:PurposeTo determine whether a machine learning technique called Kalman filtering (KF) can accurately forecast future values of mean deviation (MD), pattern standard deviation, and intraocular pressure for patients with normal tension glaucoma (NTG).DesignDevelopment and testing of a forecasting model for glaucoma progression.MethodsWe parameterized and validated a KF (KF-NTG) to forecast MD, pattern standard deviation, and intraocular pressure at 24 months into the future using 263 eyes of 263 Japanese patients with NTG. We determined the proportion of patients with MD forecasts within 0.5, 1.0, and 2.5 dBs of the actual values and calculated the root mean squared error (RMSE) for each forecast. We compared KF-NTG with a previously published KF model calibrated using patients with high-tension open-angle glaucoma (KF-HTG) and to 3 conventional forecasting algorithms.ResultsThe 263 patients with NTG had mean ± standard deviation age of 63.4 ± 10.5 years. KF-NTG forecasted MD values 24 months ahead within 0.5, 1.0, and 2.5 dBs of the actual value for 78 eyes (32.2%), 122 eyes (50.4%), and 211 eyes (87.2%), respectively. The proportion of eyes with MD values forecasted within 2.5 dB of the actual value for the KF-NTG (87.2%) were similar to KF-HTG (86.0%) and the null model (86.4%), and much better than the 2 linear regression-based models (72.7-74.0%; P < .001). When forecasting MD, KF-NTG (RMSE = 2.71) and KF-HTG (RMSE = 2.68) achieved lower RMSE than the other 3 forecasting models (RMSE = 2.81-3.90), indicating better performance.ConclusionAs observed previously for patients with HTG, KF can also effectively forecast disease trajectory for many patients with NTG.
| S-EPMC6662653 | biostudies-literature