HTGCN improves community detection in dynamic, heterogeneous graphs.
problem Challenges in detecting communities in graphs with varying features and temporal dynamics.
method Designs HTGCN combining heterogeneous GCN and residual compressed aggregation for dynamic feature representation.
result HTGCN outperforms existing methods on DBLP and IMDB datasets.
THGFM models dynamic relational systems with cross-type and temporal fusion.
problem Learning on temporal heterogeneous graphs with diverse node and relation types.
method Dual-Path Architecture with Shared-Space and Relational Type-Partitioned Temporal Attention.
result THGFM outperforms baseline models on academic graph benchmarks.
HGT models heterogeneous graphs with dedicated node and edge representations.
problem Infeasibility of existing GNNs for heterogeneous graphs.
method Node- and edge-type dependent parameters, relative temporal encoding, heterogeneous mini-batch graph sampling.
result HGT outperforms state-of-the-art GNNs by 9%--21% on various downstream tasks.
This research tackles sample complexity in causal graph recovery with temporal heterogeneity.
problem Recovering a unique causal graph from observational data with temporal heterogeneity.
method Integrates time-series dynamics and multi-environment heterogeneity to constrain the problem, enabling a rigorous analysis of statistical limits.
result Unified necessary identifiability conditions and explicit information-theoretic bounds quantify the sample complexity under different noise distributions.
Forecaster uses graph Transformers to forecast spatial and time-dependent data.
problem Complex spatial and temporal dependencies in data.
method Graph Transformer architecture with sparsification for spatial and temporal dependencies.
result Forecaster significantly outperforms state-of-the-art baselines in taxi demand forecasting.
Enhances Ponzi scheme detection on Ethereum using time-aware metapaths.
problem Lack of temporal information in heterogeneous transaction graphs.
method Time-aware Metapath Feature Augmentation (TMFAug) module.
result Significant performance improvements in Ponzi scheme detection.
Proposes a THGNN for dynamic financial time series prediction.
problem Challenges in predicting stock market price movements.
method Temporal and heterogeneous graph neural network (THGNN) approach.
result Significantly improved prediction performance compared to state-of-the-art methods.
Game-theoretic model captures investor interactions for stock price forecasting.
problem Complex market dynamics driving stock price movements.
method Game-theoretic modeling of heterogeneous investor interactions in a dynamic graph structure.
result Our method outperforms state-of-the-art stock price forecasting methods.
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.
A new method detects financial fraud using graph transformers.
problem Detecting fraudulent transactions in financial data.
method Spatial-Temporal-Aware Graph Transformer (STA-GT) integrating GNNs and transformers.
result STA-GT outperforms general GNN models on financial fraud detection.
Develops a model to detect shared communities in non-aligned graphs.
problem Clustering and community detection in non-aligned graphs with heterogeneous populations.
method Joint Stochastic Blockmodel (Joint SBM) and efficient spectral clustering.
result The joint model better estimates communities compared to separate SBMs on individual graphs.
New framework assesses deep learning models for spatio-temporal data with missing data.
problem Challenges in assessing deep learning models for spatio-temporal data with missing and heterogeneous data.
method Residual correlation analysis framework using spatio-temporal graphs and asymptotically distribution-free summary statistics.
result Identification and localization of regions where predictive performance can be improved.
Graph-based multi-view model predicts trading volume movement from various sources.
problem Lack of comprehensive understanding of trading volume movement from different sources.
method Graph-based approach incorporating long-term, short-term, and sudden event information.
result Our method outperforms strong baselines by a large margin.
Federated learning interprets temporal dynamics across clients with graph attention.
problem Interpreting temporal patterns across decentralized, heterogeneous systems with nonlinear dynamics.
method Graph Attention Network for learning state transition models over latent states communicated between clients.
result First interpretable characterization of cross-client temporal interdependencies in decentralized nonlinear systems.
Paper forecasts stock correlations using a hybrid model combining graph neural networks and transformers.
problem Improving stock correlation forecasts for better portfolio management.
method Hybrid model combining Transformer and graph attention networks for forecasting residual deviations from historical data.
result The hybrid model reduces correlation forecasting error compared to rolling-window estimates.
Proposes a graph neural network for futures price prediction.
problem Challenges in high-frequency trading of futures prices.
method Heterogeneous Continual Graph Neural Network (STGNN) integrating multi-factor pricing theories.
result Outperforms other models in prediction accuracy on 49 commodity futures.
Multistep traffic forecasting on road networks is a crucial task in successful intelligent transportation system applications. To capture the complex non-stationary temporal dynamics and spatial dependency in multistep traffic-condition prediction, we propose a novel deep learning framework named attention graph convol…
Novel graph model forecasts urban traffic with reduced spatial complexity.
problem Challenges in traffic forecasting due to spatio-temporal complexity, especially in urban environments.
method MW-TGC network model that combines spatial and temporal dependencies using multi-weighted adjacency matrices and graph convolution operations.
result MW-TGC network outperforms other models in urban-core and urban-mix sites, reducing variance in heterogeneous environments.
VisitHGNN predicts visit probabilities between neighborhoods and POIs using graph neural networks.
problem Estimating visit probabilities between neighborhoods and POIs for urban planning.
method Heterogeneous, relation-specific graph neural network (VisitHGNN) trained on mobility data.
result Strong predictive performance with high fidelity to observed travel behavior.
This review explores methods for detecting Adverse Drug Events in EHRs.
problem Detecting Adverse Drug Events (ADEs) in EHRs using temporal data.
method Examines 5 main approaches: temporal abstraction, graph-based, learning weights, and time series data.
result Challenges remain in exploiting heterogeneous temporal data for ADE detection.
Study compares deep learning models for traffic forecasting, highlighting graph elements' impact.
problem Challenges in forecasting spatial-temporal traffic patterns.
method In-depth comparative study of four deep neural network models with different basic elements.
result Graph attention improves long-term predictions in traffic forecasting models.
HL-VAE extends VAE for heterogeneous temporal and longitudinal data.
problem Handling heterogeneous data in temporal and longitudinal datasets.
method Proposes HL-VAE, an extension of existing VAEs for temporal and longitudinal data, incorporating likelihood models for various data types.
result HL-VAE achieves competitive performance in missing value imputation and predictive accuracy.
A new model predicts dynamic O-D matrices using graph neural networks and Kalman filters.
problem Predicting dynamic O-D demand matrices from traffic flow data.
method Combines graph neural networks and Kalman filters to recognize spatial and temporal patterns.
result The proposed model outperforms other methods in various prediction scenarios.
A novel spatio-temporal graph neural network with a learnable Tweedie head improves vessel traffic flow prediction in sparse maritime data.
problem Accurate vessel traffic flow prediction in sparse maritime data.
method A model-agnostic learnable Tweedie head attached to ST-GNN backbones.
result The proposed head consistently improves RMSE across multiple ST-GNN backbones, especially on non-zero events.
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.
DUET enhances multivariate time series forecasting by clustering time and channels.
problem Heterogeneous temporal patterns and complex channel correlations in multivariate time series.
method DUET uses dual clustering on temporal and channel dimensions to handle these challenges.
result DUET achieves state-of-the-art performance on 25 real-world datasets.
New method for learning on heterogeneous graphs without meta-paths.
problem Learning on heterogeneous graphs is sensitive to meta-paths choice, leading to poor performance.
method Decompose heterogeneous graph into homogeneous relation-type graphs, combine higher-order representations, use attention mechanisms.
result Our model outperforms state-of-the-art baselines in vertex classification tasks on heterogeneous graph datasets.
TG-GAN models dynamic graph evolution for continuous-time temporal graphs.
problem Challenges in modeling dynamic temporal graphs, especially in continuous time.
method Temporal Graph Generative Adversarial Network (TG-GAN) that models truncated edge sequences, time budgets, and node attributes.
result TG-GAN significantly outperforms existing methods in efficiency and effectiveness.
Paper introduces HGSL for heterogeneous graphs, improving edge type and weight recovery.
problem Learning structure in heterogeneous graphs with multiple node and edge types.
method Proposes H2MN model for DGPs and derives alternating optimization method.
result Demonstrates superior performance on synthetic and real-world datasets.
HDGI learns node representations for heterogeneous graphs.
problem Challenges in learning node representations for heterogeneous graphs.
method HDGI uses meta-path structure, graph convolution, and semantic-level attention to maximize local-global mutual information.
result HDGI outperforms state-of-the-art methods on graph-related tasks.
TGR rewires temporal graphs to improve TGNN performance.
problem Temporal graphs in evolving networks can suffer from under-reaching and over-squashing issues.
method TGR uses expander graph propagation to create message-passing highways between temporally distant nodes.
result TGR achieves state-of-the-art results on temporal graph benchmarks.
ST-UNet models spatio-temporal graphs by pooling and unpooling operations.
problem Lack of effective means to extract dynamic features from spatio-temporal graphs.
method Designing a multi-scale architecture, Spatio-Temporal U-Net (ST-UNet), with paired sampling operations.
result Achieves substantial improvements in spatio-temporal prediction tasks.
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.
GEM detects malicious accounts using adaptive embeddings from heterogeneous graphs.
problem Detecting malicious accounts on a leading mobile payment platform.
method Adaptive learning of discriminative embeddings from heterogeneous account-device graphs with attention mechanism for node importance.
result GEM consistently outperforms competitive methods in detecting malicious accounts.
Combines CNN and LSTM for spatio-temporal graph networks.
problem Improving spatio-temporal feature extraction.
method Proposes a new architecture combining CNN and LSTM temporal blocks.
result Empirical comparison shows our model outperforms existing models.
New graph kernels capture spatio-temporal interactions.
problem Lack of justified spatio-temporal graph kernels for graph problems.
method Derive graph kernels via SPDEs for spatio-temporal modelling.
result Non-separable spatio-temporal graph kernels outperform existing ones.
MTRGL learns temporal correlations from multi-modal data for improved pair trading.
problem Discerning temporal correlations among financial entities.
method Combines time series data and discrete features into a temporal graph, using a memory-based temporal graph neural network.
result MTRGL outperforms traditional methods in temporal graph link prediction and pair trading.
Graph attention networks improve performance on heterogeneous graphs.
problem Complex performance of GNNs on heterogeneous graphs.
method Integrating positional encodings into graph attention networks.
result Graph attention networks excel in node classification and link prediction.
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.
Method learns node embeddings over time for graph prediction tasks.
problem Predicting links and classifying nodes in evolving graphs.
method Proposes a joint loss function for temporal node embedding.
result Improves performance on various temporal graph tasks.
Predict sepsis early from EHR data with aggregated clinical events.
problem Predict sepsis from clinical data in EHR with temporal interactions.
method Aggregates heterogeneous clinical events, captures temporal interactions with LSTM.
result Achieved high utility score (0.321) in PhysioNet/Computing in Cardiology Challenge 2019.
CoMGNN models heterogeneous graphs with evolving nodes and edges.
problem Modeling complex, evolving graphs with diverse information.
method Meta graph attention on co-evolving heterogeneous graphs.
result Significant improvement over state-of-the-art methods.
HYPA-DBGNN detects anomalous sequential patterns in temporal graphs.
problem Modeling temporal patterns in dynamic graphs, especially considering deviations from random shuffling.
method Two-step approach combining null model inference and neural message passing.
result HYPA-DBGNN outperforms baseline methods in static node classification tasks.
3D-TGCN learns road graphs from time series similarity for spatio-temporal traffic forecasting.
problem Challenging spatio-temporal prediction in traffic networks due to dependency and dynamics.
method Proposes 3D-TGCN with novel components: spatial information-free road graph and 3D graph convolution.
result 3D-TGCN outperforms state-of-the-art baselines in traffic forecasting.
Temporal graph kernels improve classification of dissemination processes.
problem Lack of temporal information in current graph classification methods.
method Developed three temporal graph kernels and stochastic variants.
result Temporal kernels significantly outperform static kernels in accuracy.
STDGI learns node representations for spatio-temporal graphs via mutual information maximization.
problem Challenges in learning node representations for spatio-temporal graphs due to structural changes over time.
method STDGI is a fully unsupervised approach based on mutual information maximization that exploits both spatial and temporal dynamics.
result STDGI's learned node representations improve spatio-temporal auto-regressive forecasting models.
Within many real-world networks the links between pairs of nodes change over time. Thus, there has been a recent boom in studying temporal graphs. Recognizing patterns in temporal graphs requires a proximity measure to compare different temporal graphs. To this end, we propose to study dynamic time warping on temporal …
Proposes a method to improve graph neural networks on heterogeneous graphs using meta-paths.
problem Improving graph neural networks on heterogeneous graphs with auxiliary tasks.
method Self-supervised auxiliary learning with meta-paths for heterogeneous graphs.
result Consistently improves link prediction and node classification on heterogeneous graphs.