Networks evolve continuously over time with the addition, deletion, and changing of links and nodes. Such temporal networks (or edge streams) consist of a sequence of timestamped edges and are seemingly ubiquitous. Despite the importance of accurately modeling the temporal information, most embedding methods ignore it …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “temporal embeddings”
Framework for dynamic node embeddings from graph streams.
problem Temporal prediction-based applications using graph stream data.
method ε-graph time-series representation, temporal reachability graphs, weighted temporal summary graphs.
result Dynamic embedding methods achieve better predictive performance.
A new method for embedding temporal relationships in graphs.
problem Limited performance of existing time-aware graph embedding methods.
method Integrates temporal smoothness and task-oriented negative sampling.
result Improves performance in various tasks, especially entity/relationship/temporal scoping prediction.
Knowledge Graph (KG) embedding has attracted more attention in recent years. Most KG embedding models learn from time-unaware triples. However, the inclusion of temporal information beside triples would further improve the performance of a KGE model. In this regard, we propose ATiSE, a temporal KG embedding model which…
In this work, we present a method for node embedding in temporal graphs. We propose an algorithm that learns the evolution of a temporal graph's nodes and edges over time and incorporates this dynamics in a temporal node embedding framework for different graph prediction tasks. We present a joint loss function that cre…
Short-term demand forecasting models commonly combine convolutional and recurrent layers to extract complex spatiotemporal patterns in data. Long-term histories are also used to consider periodicity and seasonality patterns as time series data. In this study, we propose an efficient architecture, Temporal-Guided Networ…
TGAT learns node embeddings for evolving graphs, capturing both static and temporal features.
problem Learning node embeddings for dynamic graphs with evolving topological structures and temporal patterns.
method Temporal Graph Attention (TGAT) layer using self-attention and functional time encoding.
result TGAT model can inductively infer node embeddings for new and observed nodes as the graph evolves.
Knowledge graphs (KGs) typically contain temporal facts indicating relationships among entities at different times. Due to their incompleteness, several approaches have been proposed to infer new facts for a KG based on the existing ones-a problem known as KG completion. KG embedding approaches have proved effective fo…
Network embedding aims to embed nodes into a low-dimensional space, while capturing the network structures and properties. Although quite a few promising network embedding methods have been proposed, most of them focus on static networks. In fact, temporal networks, which usually evolve over time in terms of microscopi…
EPNE models evolving network patterns for better predictions.
problem Capturing evolving patterns in dynamic networks.
method EPNE models temporal network evolution using causal convolutions and a temporal objective function.
result EPNE outperforms other methods in various prediction tasks.
MEANTIME improves sequential recommendation by using multi-temporal embeddings and attention mechanisms.
problem Limited use of timestamp information and information bottleneck in sequential recommendation models.
method MEANTIME employs multiple types of temporal embeddings and attention mechanisms to capture diverse patterns from user behavior sequences.
result MEANTIME outperforms state-of-the-art sequential recommendation methods.
In this work, we consider the problem of combining link, content and temporal analysis for community detection and prediction in evolving networks. Such temporal and content-rich networks occur in many real-life settings, such as bibliographic networks and question answering forums. Most of the work in the literature (…
OracleAD detects multivariate time series anomalies without labels.
problem Rare and unlabeled multivariate time series anomalies.
method OracleAD encodes past sequences into causal embeddings, projects them into a latent space, and identifies anomalies based on deviations from a stable latent structure.
result OracleAD achieves state-of-the-art results and is interpretable.
A model for POI recommendation using relation embedding.
problem Challenges in POI recommendation due to sparse user-POI matrix and varying context.
method Translation-based relation embedding using Knowledge Graph Embedding techniques, combined matrix factorization framework.
result Demonstrates effectiveness of the proposed model on real-world datasets.
Evaluating KGR10 Polish word embeddings in the recognition of temporal expressions using BiLSTM-CRFcs.CL
The article introduces a new set of Polish word embeddings, built using KGR10 corpus, which contains more than 4 billion words. These embeddings are evaluated in the problem of recognition of temporal expressions (timexes) for the Polish language. We described the process of KGR10 corpus creation and a new approach to …
Develops a new framework for temporal anchoring in deep embedding spaces.
problem Temporal anchoring in deep embedding spaces, especially drift and convergence issues.
method Operator-theoretic framework with drift maps and event-indexed blocks, proving convergence theorems and equivalence theorems.
result Proves convergence theorems and equivalence theorems for the proposed framework.
Recently, self-supervised learning has proved to be effective to learn representations of events suitable for temporal segmentation in image sequences, where events are understood as sets of temporally adjacent images that are semantically perceived as a whole. However, although this approach does not require expensive…
EHNA learns node embeddings from historical network neighborhoods.
problem Capturing temporal information in evolving networks.
method Temporal random walk and deep learning model with attention mechanism.
result EHNA outperforms existing methods in network reconstruction and link prediction tasks.
New algorithm for RL using mean embeddings of return distributions.
problem Improving reinforcement learning algorithms for dynamic programming.
method Mean embeddings of return distributions, novel algorithms for RL.
result Asymptotic convergence and improved performance in deep RL.
GTEA: Inductive Representation Learning on Temporal Interaction Graphs via Temporal Edge Aggregationcs.LG
GTEA learns node representations in temporal interaction graphs.
problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.
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.
SANST uses self-attentive networks with spatial and temporal embeddings for better POI recommendations.
problem Next point-of-interest (POI) recommendation for users based on their history.
method SANST incorporates spatio-temporal patterns into self-attentive networks.
result SANST outperforms state-of-the-art models by up to 13.65% in nDCG@10.
CTGCN learns dynamic graph embeddings preserving both local and global graph structure.
problem Learning node representations for evolving graphs while preserving both local and global graph structure.
method CTGCN uses k-core based temporal graph convolutional network to learn dynamic graph embeddings.
result CTGCN outperforms existing methods in link prediction and structural role classification.
Encoder-decoder recurrent neural network models (RNN Seq2Seq) have achieved great success in ubiquitous areas of computation and applications. It was shown to be successful in modeling data with both temporal and spatial dependencies for translation or prediction tasks. In this study, we propose an embedding approach t…
Efficient Hierarchical Bayesian Inference for Spatio-temporal Regression Models in Neuroimagingstat.ML
Novel Bayesian framework for spatio-temporal neuroimaging data.
problem Inference on multi-task sparse hierarchical regression models with complex spatio-temporal dynamics.
method Flexible hierarchical Bayesian framework with Kronecker product covariance structure, majorization-minimization optimization, and Riemannian geometry.
result Improved performance on synthetic and real M/EEG data.
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.
DyHATR learns dynamic heterogeneous networks for better link prediction.
problem Learning effective representations of dynamic heterogeneous networks for link prediction.
method Hierarchical attention for heterogeneous information and temporal RNN for evolutionary patterns.
result DyHATR significantly outperforms state-of-the-art baselines on link prediction tasks.
Method analyzes large-scale network data to detect communication pattern shifts.
problem Analyzing large-scale time-series network data is challenging.
method Temporal encoder embedding method using ground-truth or estimated vertex labels.
result Detects communication pattern shifts across all levels of network structure.
This paper proposes an out-of-sample extension framework for a global manifold learning algorithm (Isomap) that uses temporal information in out-of-sample points in order to make the embedding more robust to noise and artifacts. Given a set of noise-free training data and its embedding, the proposed framework extends t…
In this article, existence results concerning temporal functions with additional properties on a globally hyperbolic manifold are obtained. These properties are certain bounds on geometric quantities as lapse and shift. The results are linked to completeness properties and the existence of closed isometric embeddings i…
New model captures patient-level EHR data efficiently.
problem Irregular EHR code timing and lack of temporal structure.
method Latent factor point process model with Fourier-Eigen embedding.
result Efficiently captures subgroup-specific temporal patterns.
Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Pointsstat.ML
Develops MENT for interpreting and detecting changes in network trajectories.
problem Distortion of network geometry and invalidation of temporal comparisons in dynamic network analysis.
method Develops Multiscale Euclidean Network Trajectories (MENT) framework based on second-moment geometry.
result Validates and interprets network trajectories through isotropic normalization and orthogonal transformations.
Word evolution refers to the changing meanings and associations of words throughout time, as a byproduct of human language evolution. By studying word evolution, we can infer social trends and language constructs over different periods of human history. However, traditional techniques such as word representation learni…
Analyzing the temporal behavior of nodes in time-varying graphs is useful for many applications such as targeted advertising, community evolution and outlier detection. In this paper, we present a novel approach, STWalk, for learning trajectory representations of nodes in temporal graphs. The proposed framework makes u…
MTHetGNN models complex relations in multivariate time series forecasting.
problem Complex relations among variables in multivariate time series forecasting.
method Designs a relation embedding module and a temporal embedding module, using graph neural networks and CNNs.
result Achieves state-of-the-art results in multivariate time series forecasting.
Ultralow-dimensionality reduction for identifying critical transitions by spatial-temporal PCAstat.ML
A new method identifies critical transitions in high-dimensional data.
problem Challenges in identifying critical transitions in high-dimensional time-series data.
method Spatial-temporal Principal Component Analysis (stPCA)
result Identifies tipping points before critical transitions reliably.
New method predicts spatio-temporal data with short and long-range dependence.
problem Uncertainty in predicting the distribution of mixed moving average fields.
method Theory-guided machine learning approach using generalized Bayesian algorithm.
result Fixed-time and any-time PAC Bayesian bounds for ensemble forecasts.
DBGDGM models dynamic brain graphs for better understanding brain function.
problem Previous brain graph models ignore temporal dynamics, limiting their usefulness.
method DBGDGM clusters brain regions into evolving communities and learns dynamic node embeddings.
result DBGDGM outperforms baselines in graph generation, dynamic link prediction, and graph classification.
The widespread availability of electronic health records (EHRs) promises to usher in the era of personalized medicine. However, the problem of extracting useful clinical representations from longitudinal EHR data remains challenging. In this paper, we explore deep neural network models with learned medical feature embe…
Spatio-temporal graphs such as traffic networks or gene regulatory systems present challenges for the existing deep learning methods due to the complexity of structural changes over time. To address these issues, we introduce Spatio-Temporal Deep Graph Infomax (STDGI)---a fully unsupervised node representation learning…
Develops a hybrid deep learning model for stock price prediction.
problem Predicting daily stock prices in the stock market.
method Representation learning with Stock2Vec embedding and temporal convolutional layers.
result Achieves better performance on stock price prediction than benchmarks.
Place Cells as Multi-Scale Position Embeddings: Random Walk Transition Kernels for Path Planningq-bio.NC
Model place cells as spatial embeddings for efficient path planning and cognitive map construction.
problem Encoding spatial navigation in the hippocampus.
method Model place cells using spectral decomposition of multi-step random walk transition kernels, inducing sparsity and adjacency.
result Place cells encode spatial information through non-negativity and inner-product structure, forming a cognitive map.
THEME: Enhancing Thematic Investing with Semantic Stock Representations and Temporal Dynamicsq-fin.PM
Enhances thematic investing with stock embeddings from textual data.
problem Challenges in constructing thematic portfolios due to overlapping sector boundaries and evolving market dynamics.
method Introduces THEME, a framework that fine-tunes embeddings using hierarchical contrastive learning, aligning themes and stocks using their hierarchical relationship and incorporating stock returns.
result Theme-aligned portfolios demonstrate compelling performance, significantly outperforming large language models in thematic asset retrieval.
DynamicGEM is an open-source Python library for learning node representations of dynamic graphs. It consists of state-of-the-art algorithms for defining embeddings of nodes whose connections evolve over time. The library also contains the evaluation framework for four downstream tasks on the network: graph reconstructi…
HyPV-LEAD detects cryptocurrency anomalies proactively, improving financial security.
problem Cryptocurrency anomalies like mixing, fraud, and pump-and-dump operations are hard to detect due to class imbalance and temporal volatility.
method HyPV-LEAD integrates lead time into anomaly detection through window-horizon modeling, Peak-Valley sampling, and hyperbolic embedding.
result HyPV-LEAD achieves a PR-AUC of 0.9624 on Bitcoin transaction data, significantly outperforming state-of-the-art methods.
Paper tackles class-incremental time series classification with dual-stream feature extraction.
problem Class-incremental continual learning for multivariate time series data.
method Dual-stream feature extraction pipeline combining deep temporal embedding features and statistical features.
result Competitive average accuracy across multiple datasets with low forgetting rates.
VTD uses deep embeddings to estimate treatment effects from longitudinal data without unconfoundedness assumption.
problem Challenges in estimating individualized treatment effects from longitudinal observational data due to confounding bias.
method Leverages deep variational embeddings and observed proxies to learn hidden confounders.
result Effective in estimating treatment effects when hidden confounding is the leading bias.
EEG-TCNet improves MI-BMIs with high accuracy and low resource usage.
problem Improving motor-imagery brain-machine interfaces with high accuracy and low resource usage.
method Proposes EEG-TCNet, a novel TCN for embedded MI-BMIs.
result EEG-TCNet achieves 83.84% classification accuracy on MOABB, outperforming SoA by 0.25.