2023
DOI: 10.26599/tst.2021.9010081
|View full text |Cite
|
Sign up to set email alerts
|

Multivariate Time Series Forecasting with Transfer Entropy Graph

Abstract: Multivariate Time Series (MTS) forecasting is an essential problem in many fields. Accurate forecasting results can effectively help in making decisions. To date, many MTS forecasting methods have been proposed and widely applied. However, these methods assume that the predicted value of a single variable is affected by all other variables, ignoring the causal relationship among variables. To address the above issue, we propose a novel end-to-end deep learning model, termed graph neural network with neural Gra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 44 publications
0
4
0
Order By: Relevance
“…Each variable is regarded as a graph node and each edge means the casual relationship. It is confirmed for multivariate time series forecasting in the dataset of appliances energy consumption [20].…”
Section: Introductionsupporting
confidence: 52%
“…Each variable is regarded as a graph node and each edge means the casual relationship. It is confirmed for multivariate time series forecasting in the dataset of appliances energy consumption [20].…”
Section: Introductionsupporting
confidence: 52%
“…The unbounded causality matrix, or more precisely the predictive causality matrix TE unconstrained to any prediction of biodiversity patterns as in [ 42 ], based on calculated TEs without the optimization of and predictive environmental factors of ecological patterns in an optimal information flow perspective, can be constructed as follows: where is indeed a difference of transfer entropies as in the transfer entropy graph neural network model (TEGNN) (originally developed by Duan et al [ 52 ] and applied to algal blooms by [ 51 ]) in contrast to the optimal information flow model (OIF) originally developed by Li and Convertino [ 20 ]. For each year, two networks were constructed with each defined by an underlying matrix of transfer entropy differences .…”
Section: Methodsmentioning
confidence: 99%
“…Removed nonlinear activations and feature transformations from the network architecture to address graph convolutional networks [15]. They uses GNN to handle a variety of characteristics and created a component to look at the relationship between potential neighbor nodes [16]. Object interactions were captured in using a self-attentive graph neural network and a soft attention method [17].…”
Section: Related Workmentioning
confidence: 99%
“…Here 𝜏 and πœ— are considered as the hyper-parameter so that the denominator is not 0. Based on the values ofπ‘π‘Ÿπ‘’π‘‘(𝑆 𝑓 |𝑆 𝑑,𝑗 ) shown by (16) Based on the results considered π‘π‘Ÿπ‘’π‘‘(𝑑) and π‘π‘Ÿπ‘’π‘‘(𝑑) the value of π‘π‘Ÿπ‘’π‘‘(𝑆 𝑓 |𝑆 𝑑,𝑗 ) is re-evaluated by (15). The evaluation is carried out above until the π‘π‘Ÿπ‘’π‘‘(𝑆 𝑓 |𝑆 𝑑,𝑗 ) that reaches the community to achieve the large value for π‘π‘Ÿπ‘’π‘‘(𝑆 𝑓 |𝑆 𝑑,𝑗 ) as the final community that links the 𝑆 𝑑,𝑗 .…”
Section: Edge Clusteringmentioning
confidence: 99%