SWoTTeD discovers hidden temporal patterns in EHR data.
problem Complex temporal patterns in EHR data.
method Sliding Window for Temporal Tensor Decomposition (SWoTTeD) with constraints and regularizations.
result SWoTTeD achieves at least as accurate reconstruction as state-of-the-art models and extracts meaningful temporal phenotypes.
ATiSE embeds temporal information into KGs using time series decomposition.
problem Improving KG embedding models by incorporating temporal information.
method ATiSE uses Additive Time Series decomposition to map temporal KGs into multi-dimensional Gaussian distributions.
result ATiSE achieves state-of-the-art performance on link prediction over four temporal KGs.
TATD predicts missing entries in time-evolving tensors by exploiting temporal dependency and sparsity.
problem Predict missing entries in time-evolving tensors with temporal dependency and sparsity issues.
method TATD (Time-Aware Tensor Decomposition) integrates temporal dependency and time-varying sparsity through a smoothing regularization with Gaussian kernel and alternating optimization.
result TATD achieves state-of-the-art accuracy for decomposing temporal tensors.
Proposes a new tensor decomposition method for functional temporal data with adaptive complexity.
problem Challenges in temporal tensor decomposition for general tensor data with continuous indexes.
method Encodes continuous spatial indexes as learnable Fourier features and uses neural ODEs for temporal trajectories. Introduces a sparsity-inducing prior for complexity adaptation.
result Significantly outperforms existing methods in prediction performance and robustness against noise.
New method uses conformal prediction for time series forecasting, accounting for temporal correlation.
problem Uncertainty quantification in temporally correlated time series data.
method Time series decomposition with component-wise conformal prediction.
result The method provides customized prediction intervals for different temporal components.
Optimized DMD for fast atmospheric chemistry forecasting.
problem Forecasting global atmospheric chemistry dynamics efficiently.
method Optimized Dynamic Mode Decomposition (DMD) for reduced order modeling.
result Significant improvement in computational speed and interpretability.
A new tensor-based method for predicting temporal relationships in knowledge bases.
problem Predicting temporal relationships in evolving knowledge bases.
method Tensor decomposition of order 4 with new regularization schemes.
result Achieves state-of-the-art performance in temporal link prediction.
ST-MTM models complex time series by decomposing and masking seasonal and trend components.
problem Forecasting complex time series with intricate temporal variations.
method Seasonal-Trend Decomposition with Masking and Contrastive Learning.
result ST-MTM achieves superior forecasting performance compared to existing methods.
Proposes tPARAFAC2 for tracking evolving patterns in time-evolving data.
problem Lack of temporal regularization in tensor factorizations for capturing evolving patterns.
method Temporal PARAFAC2 (tPARAFAC2) with temporal regularization.
result tPARAFAC2 accurately captures evolving patterns better than existing methods.
Paper introduces an unsupervised tensor-based anomaly detection method for spatiotemporal data.
problem Challenges in detecting anomalies in spatiotemporal data, especially in urban traffic monitoring and medical imaging.
method Formulates anomaly detection as a regularized robust low-rank + sparse tensor decomposition, incorporating spatiotemporal smoothness and local dependencies.
result Demonstrates improved anomaly detection performance on both synthetic and real data.
We consider N-way data arrays and low-rank tensor factorizations where the time mode is coded as a sparse linear combination of temporal elements from an over-complete library. Our method, Shape Constrained Tensor Decomposition (SCTD) is based upon the CANDECOMP/PARAFAC (CP) decomposition which produces r-rank appr…
Paper develops a method for causal representation learning from irregular tensors.
problem Complex patterns in high-dimensional, irregular tensor data.
method Novel causal formulation and CaRTeD framework integrating temporal causal representation learning with irregular tensor decomposition.
result Framework provides theoretical guarantees and outperforms state-of-the-art techniques.
DEMOTE uses neural diffusion-reaction processes to capture temporal dynamics in sparse tensor data.
problem Sparse and temporally associated tensor data with limited structural knowledge.
method Develops a neural diffusion-reaction process to estimate dynamic embeddings for tensor modes.
result Captures both commonalities and personalities in evolving tensor entries.
New method improves dynamic topic modeling for large-scale data.
problem Lack of temporal information in dynamic topic modeling.
method Nonnegative CP tensor decomposition (NNCPD) for data tensor.
result Significantly improved results compared to NMF-based methods.
Paper proposes a new LSTM model for spatio-temporal learning.
problem Challenging video tasks require learning long-term spatio-temporal correlations.
method Introduces a higher-order convolutional LSTM model with tensor train decomposition.
result Model achieves state-of-the-art performance with significantly fewer parameters.
KEDformer improves long-term time series forecasting with seasonal-trend decomposition.
problem Accurate long-term predictions in energy, finance, and meteorology.
method Knowledge extraction-driven framework integrating seasonal-trend decomposition.
result KEDformer enhances model's ability to capture short-term and long-term patterns.
Kernel Dynamic Mode Decomposition reconstructs dynamical systems using Laplacian kernel.
problem Reconstructing spatial-temporal dynamics of complex systems.
method Kernel Dynamic Mode Decomposition with Laplacian kernel.
result Laplacian kernel allows for the closability of Koopman operators in RKHS, enabling reconstruction.
We present a method for fast resting-state fMRI spatial decomposi-tions of very large datasets, based on the reduction of the temporal dimension before applying dictionary learning on concatenated individual records from groups of subjects. Introducing a measure of correspondence between spatial decompositions of rest …
Paper uses DMD to embed time in spatiotemporal forecasting.
problem Forecasting long-range seasonal dependencies in spatiotemporal data.
method Dynamic Mode Decomposition (DMD) for time representation.
result DMD-based embedding improves long-horizon forecasting accuracy.
Spatio-temporal data is intrinsically high dimensional, so unsupervised modeling is only feasible if we can exploit structure in the process. When the dynamics are local in both space and time, this structure can be exploited by splitting the global field into many lower-dimensional "light cones". We review light cone …
The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In this paper, we consider the problem of temporal link prediction: Given link data for times 1 through T, can we predict the links at time T+1? If our da…
Unified model forecasts epidemics with spatial and temporal dynamics.
problem Limited accuracy in traditional models and lack of interpretability in deep learning models.
method CSTGNN integrates Spatio-Contact SIR model with Graph Neural Networks.
result Effective spatiotemporal epidemic forecasting with interpretability.
We present an approach for penalized tensor decomposition (PTD) that estimates smoothly varying latent factors in multi-way data. This generalizes existing work on sparse tensor decomposition and penalized matrix decompositions, in a manner parallel to the generalized lasso for regression and smoothing problems. Our ap…
The paper develops a new model to evaluate policies in complex temporal/spatial experiments.
problem Evaluating the impact of policies in experiments with temporal and spatial dependencies.
method Temporal/spatio-temporal Varying Coefficient Decision Process (VCDP) model, decomposing ATE into DE and IE.
result Effective estimation and inference of DE and IE with rigorous statistical analysis.
We demonstrate the application of an algorithmic trading strategy based upon the recently developed dynamic mode decomposition (DMD) on portfolios of financial data. The method is capable of characterizing complex dynamical systems, in this case financial market dynamics, in an equation-free manner by decomposing the s…
Model predicts short-term Amazon rainforest fires with high accuracy.
problem Accurate short-term forecasting of Amazon rainforest fires is challenging.
method Used Seasonal and Trend decomposition based on Loess combined with multi-month-ahead load forecasting algorithms.
result Proposed decomposition-ensemble models provide more accurate forecasts than other models.
Current techniques for explainable AI have been applied with some success to image processing. The recent rise of research in video processing has called for similar work n deconstructing and explaining spatio-temporal models. While many techniques are designed for 2D convolutional models, others are inherently applica…
Framework isolates causal effects from time series data, improving accuracy under non-stationarity and autocorrelation.
problem Causal inference in non-stationary, autocorrelated time series data.
method Decomposes time series into trend, seasonal, and residual components; performs component-specific causal analysis.
result Framework more accurately recovers ground-truth causal structure than state-of-the-art baselines, especially under strong non-stationarity and temporal autocorrelation.
This paper reviews methods for discovering patient subgroups from EHR data.
problem Discovering subgroups of patients and co-occurring medical conditions from EHR data.
method Low-rank data approximation methods like matrix and tensor decompositions.
result These methods provide transparent and interpretable insights into patient phenotypes.
BSG learns dynamic network spillovers and uncertainty quantification.
problem Identifying indirect spillovers and systemic risk in dynamic networks.
method Bayesian Spillover Graphs using FEVD and Bayesian time series models.
result Significant performance gains over baselines in identifying source and sink nodes.
Proposes MVGPR for spatiotemporal data modal analysis.
problem Sparse and irregularly sampled data in complex flows.
method Multivariate Gaussian process regression (MVGPR) with kernel design.
result MVGPR outperforms DMD and SPOD in modal analysis of sparse and irregular data.
In this paper we consider the use of the space vs. time Kronecker product decomposition in the estimation of covariance matrices for spatio-temporal data. This decomposition imposes lower dimensional structure on the estimated covariance matrix, thus reducing the number of samples required for estimation. To allow a sm…
DiPCA algorithm improves scalability and solution quality for time-dependent data.
problem Analyzing time-dependent multivariate data with dynamic latent variables.
method Solves a large-scale, dense, nonconvex NLP using a scalable decomposition algorithm.
result The decomposition algorithm is a specialized coordinate maximization algorithm, explaining its performance and guiding improvements.
Efficiently estimates longitudinal networks by merging sparse networks.
problem Estimating longitudinal networks with sparse and temporal data.
method Adaptive network merging, tensor decomposition, point process.
result Significantly reduces estimation error and provides guidance for network merging.
Probabilistic Temporal Tensor Factorization (PTTF) is an effective algorithm to model the temporal tensor data. It leverages a time constraint to capture the evolving properties of tensor data. Nowadays the exploding dataset demands a large scale PTTF analysis, and a parallel solution is critical to accommodate the tre…
Many advanced Learning from Demonstration (LfD) methods consider the decomposition of complex, real-world tasks into simpler sub-tasks. By reusing the corresponding sub-policies within and between tasks, they provide training data for each policy from different high-level tasks and compose them to perform novel ones. E…
Tensors are multidimensional arrays of numerical values and therefore generalize matrices to multiple dimensions. While tensors first emerged in the psychometrics community in the 20th century, they have since then spread to numerous other disciplines, including machine learning. Tensors and their decomposi…
Paper introduces TSSDMN for modeling dynamic multilayer networks.
problem Capturing temporal and cross-layer dynamics in multilayer networks.
method Tensor State Space Model (TSSDMN) using symmetric Tucker decomposition.
result TSSDMN uniquely captures temporal dynamics within and across layers.
Neural signals are characterized by rich temporal and spatiotemporal dynamics that reflect the organization of cortical networks. Theoretical research has shown how neural networks can operate at different dynamic ranges that correspond to specific types of information processing. Here we present a data analysis framew…
Unified model explains volatility memory in stocks and forex.
problem Understanding the components of volatility memory in financial markets.
method Developed a three-dimensional decomposition of volatility memory into level, shape, and tempo.
result Unified model shows that volatility memory is state-dependent, with different gates prevailing in equities and forex.
We introduce Bayesian Poisson Tucker decomposition (BPTD) for modeling country--country interaction event data. These data consist of interaction events of the form "country i took action a toward country j at time t." BPTD discovers overlapping country--community memberships, including the number of latent com…
Variables in many massive high-dimensional data sets are structured, arising for example from measurements on a regular grid as in imaging and time series or from spatial-temporal measurements as in climate studies. Classical multivariate techniques ignore these structural relationships often resulting in poor performa…
The paper tackles model-based RL's inaccuracy issue by dynamically adjusting planning horizons.
problem Model-based RL's failure due to model inaccuracy over long planning horizons.
method State-dependent planning horizon, learning cumulative model errors with Temporal Difference methods.
result The proposed method successfully adapts planning horizons to state-dependent model accuracy, improving policy learning efficiency.
Unified method for discovering biclusters and triclusters in longitudinal data.
problem High-dimensional, sparsely sampled, irregularly observed longitudinal data.
method Tri-SfSVD, a unified sparse functional Singular Value Decomposition framework.
result Identified localized structures at the subject, subject-feature, and subject-feature-time levels.
Higher-order tensors have received increased attention across science and engineering. While most tensor decomposition methods are developed for a single tensor observation, scientific studies often collect side information, in the form of node features and interactions thereof, together with the tensor data. Such data…
Neurons predict future scalar inputs by learning top modes of lag vectors.
problem Predicting future scalar inputs with physiological delays.
method Normal Mode Decomposition to extract independently evolving modes.
result Temporal filters of neurons correspond to left eigenvectors of a generalized eigenvalue problem.
Deep learning improves solar energy forecasting using physical and data-driven models.
problem Improving short-term solar energy forecasting accuracy.
method Injecting physical knowledge into deep learning models for spatio-temporal forecasting.
result Improved solar energy forecasting models using deep learning and physical criteria.
In this work we consider the problem of detecting anomalous spatio-temporal behavior in videos. Our approach is to learn the normative multiframe pixel joint distribution and detect deviations from it using a likelihood based approach. Due to the extreme lack of available training samples relative to the dimension of t…