Signal Processing on Graphs: Causal Modeling of Unstructured Data
arXiv:1503.00173 · doi:10.1109/TSP.2016.2634543
Abstract
Many applications collect a large number of time series, for example, the financial data of companies quoted in a stock exchange, the health care data of all patients that visit the emergency room of a hospital, or the temperature sequences continuously measured by weather stations across the US. These data are often referred to as unstructured. A first task in its analytics is to derive a low dimensional representation, a graph or discrete manifold, that describes well the interrelations among the time series and their intrarelations across time. This paper presents a computationally tractable algorithm for estimating this graph that structures the data. The resulting graph is directed and weighted, possibly capturing causal relations, not just reciprocal correlations as in many existing approaches in the literature. A convergence analysis is carried out. The algorithm is demonstrated on random graph datasets and real network time series datasets, and its performance is compared to that of related methods. The adjacency matrices estimated with the new method are close to the true graph in the simulated data and consistent with prior physical knowledge in the real dataset tested.
References in corpus (5)
- Stochastic blockmodels and community structure in networks
- Discrete Signal Processing on Graphs
- Loopy Belief Propagation for Approximate Inference: An Empirical Study
- Learning Single Index Models in High Dimensions
- LICORS: Light Cone Reconstruction of States for Non-parametric Forecasting of Spatio-Temporal Systems
Cited by in corpus (37)
- Graph Learning: A Survey
- Learning graphs from data: A signal representation perspective
- Connecting the Dots: Identifying Network Structure via Graph Signal Processing
- Stationary Graph Processes and Spectral Estimation
- Graph Signal Processing: History, Development, Impact, and Outlook
- Forecasting Time Series with VARMA Recursions on Graphs
- Irregularity-Aware Graph Fourier Transforms
- Graph topology inference based on sparsifying transform learning
- Spectral Projector-Based Graph Fourier Transforms
- Graph Fourier Transform: A Stable Approximation
- Network Inference from Consensus Dynamics with Unknown Parameters
- Bayesian Estimation of Graph Signals
- Local Tomography of Large Networks under the Low-Observability Regime
- SILVar: Single Index Latent Variable Models
- Robust Graph Filter Identification and Graph Denoising from Signal Observations
- Observing and Tracking Bandlimited Graph Processes
- Widely-Linear MMSE Estimation of Complex-Valued Graph Signals
- A Review of Graph-Powered Data Quality Applications for IoT Monitoring Sensor Networks
- Sampling and Inference of Networked Dynamics using Log-Koopman Nonlinear Graph Fourier Transform
- Graph Learning for Spatiotemporal Signals with Long- and Short-Term Characterization
- Node-Adaptive Regularization for Graph Signal Reconstruction
- Supervised Linear Regression for Graph Learning from Graph Signals
- Plato: Approximate Analytics over Compressed Time Series with Tight Deterministic Error Guarantees
- Signal Processing on Directed Graphs
- Online Inference for Mixture Model of Streaming Graph Signals with Non-White Excitation
- Learning hidden influences in large-scale dynamical social networks: A data-driven sparsity-based approach
- Methods of Adaptive Signal Processing on Graphs Using Vertex-Time Autoregressive Models
- High-Dimensional Bernoulli Autoregressive Process with Long-Range Dependence
- Online Distributed Learning over Graphs with Multitask Graph-Filter Models
- Graph Signal Processing over a Probability Space of Shift Operators
- Online Graph Topology Learning from Matrix-valued Time Series
- GSA-Forecaster: Forecasting Graph-Based Time-Dependent Data with Graph Sequence Attention
- Single Index Latent Variable Models for Network Topology Inference
- Efficient structure learning with automatic sparsity selection for causal graph processes
- Time-Varying Graph Learning with Constraints on Graph Temporal Variation
- Topology Inference over Networks with Nonlinear Coupling
- How likely is a random graph shift-enabled?