SimVGNets: Similarity-Based Visibility Graph Networks for Carbon Price Forecasting

被引:22
作者
Mao, Shengzhong [1 ]
Zeng, Xiao-Jun [1 ]
机构
[1] Univ Manchester, Dept Comp Sci, Manchester M13 9PL, England
关键词
Carbon price forecasting; Visibility graph; Random walk; Time series; TIME-SERIES;
D O I
10.1016/j.eswa.2023.120647
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In response to global warming, carbon trading market emerges to reduce carbon emissions. However, uncertain fluctuations and complicated price mechanisms in the market have changed the characteristics of carbon data. Existing methods cannot track underlying structures among carbon data streams, failing to explain high variations and predict carbon prices accurately. In this case, how to predict carbon price is a problem demanding new and prompt solutions. Unlike existing predictive mechanisms with fixed structure, in this work, we investigate carbon price from a novel perspective of visibility graph networks, developing a variant forecasting framework based on visible relationships. Firstly, carbon prices are mapped into networks where data are transformed into corresponding nodes utilizing visibility algorithm. Then a novel similarity index is proposed to measure similarity distribution of nodes converted from carbon data, which extracts past and recent price information rather than only considering recent input, resulting in the loss of past knowledge. The forecasting model is finally established based on mutual visibility machamism and similarity of constructed carbon network. To verify the proposed method, experiments are conducted on real carbon datasets, and the results demonstrate the method is superior to existing models, suggesting the predictive potentials of graph network science. It is hoped that this work can act as a bridge between carbon data and networks, motivating further research on carbon price forecasting from graph network views.
引用
收藏
页数:8
相关论文
共 52 条
[1]   The Cover Time of a Random Walk in Affiliation Networks [J].
Bloznelis, Mindaugas ;
Jaworski, Jerzy ;
Rybarczyk, Katarzyna .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (09) :6134-6150
[2]   GENERALIZED AUTOREGRESSIVE CONDITIONAL HETEROSKEDASTICITY [J].
BOLLERSLEV, T .
JOURNAL OF ECONOMETRICS, 1986, 31 (03) :307-327
[3]   International carbon financial market prediction using particle swarm optimization and support vector machine [J].
Chen, Junhua ;
Ma, Shufan ;
Wu, Ying .
JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2021, 13 (12) :5699-5713
[4]   Probability transformation of mass function: A weighted network method based on the ordered visibility graph [J].
Chen, Luyuan ;
Deng, Yong ;
Cheong, Kang Hao .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 105
[5]   A new method to predict the interference effect in quantum-like Bayesian networks [J].
Dai, Jiongyu ;
Deng, Yong .
SOFT COMPUTING, 2020, 24 (14) :10287-10294
[6]   Random walk through a stock network and predictive analysis for portfolio optimization [J].
Freitas, Washington Burkart ;
Junior, Joao Roberto Bertini .
EXPERT SYSTEMS WITH APPLICATIONS, 2023, 218
[7]   A novel network-based and divergence-based time series forecasting method [J].
Gao, Qiuya ;
Wen, Tao ;
Deng, Yong .
INFORMATION SCIENCES, 2022, 612 :553-562
[8]   TIME-SERIES ANALYSIS - FORECASTING AND CONTROL - BOX,GEP AND JENKINS,GM [J].
GEURTS, M .
JOURNAL OF MARKETING RESEARCH, 1977, 14 (02) :269-269
[9]   A hybrid method of link prediction in directed graphs [J].
Ghorbanzadeh, Hossien ;
Sheikhahmadi, Amir ;
Jalili, Mahdi ;
Sulaimany, Sadegh .
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 165
[10]  
Hochreiter S, 1997, NEURAL COMPUT, V9, P1735, DOI [10.1162/neco.1997.9.1.1, 10.1007/978-3-642-24797-2]