{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:46:25Z","timestamp":1760233585239,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2021,1,26]],"date-time":"2021-01-26T00:00:00Z","timestamp":1611619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Science and Technology Plan of Hunan Province Project","award":["2016JC2011"],"award-info":[{"award-number":["2016JC2011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>In multiple related time series prediction problems, the key is capturing the comprehensive influence of the temporal dependencies within each time series and the interactional dependencies between time series. At present, most time series prediction methods are difficult to capture the complex interaction between time series, which seriously affects the prediction results. In this paper, we propose a novel deep learning model Multiple Time Series Generative Adversarial Networks (MTSGAN) based on generative adversarial networks to solve this problem. MTSGAN is mainly composed of three components: interaction matrix generator, prediction generator, and time series discriminator. In our model, graph convolutional networks are used to extract interactional dependencies, and long short-term memory networks are used to extract temporal dependencies. Through the adversarial training between the generator and the discriminator, we enable the final prediction generator to generate prediction values that are very close to the true values. At last, we compare the prediction performance of the MTSGAN with other benchmarks on different datasets to prove the effectiveness of our proposed model, and we find that MTSGAN model consistently outperforms other state-of-the-art methods in the multiple related time series prediction problems.<\/jats:p>","DOI":"10.3390\/info12020055","type":"journal-article","created":{"date-parts":[[2021,1,26]],"date-time":"2021-01-26T08:29:16Z","timestamp":1611649756000},"page":"55","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Prediction Method of Multiple Related Time Series Based on Generative Adversarial Networks"],"prefix":"10.3390","volume":"12","author":[{"given":"Weijie","family":"Wu","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]},{"given":"Fang","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]},{"given":"Yidi","family":"Kao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]},{"given":"Zhou","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]},{"given":"Qi","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]}],"member":"1968","published-online":{"date-parts":[[2021,1,26]]},"reference":[{"key":"ref_1","unstructured":"Box, G.E.P., and Jenkins, G. (1990). Time Series Analysis, Forecasting and Control, Holden-Day, Inc."},{"key":"ref_2","first-page":"2672","article-title":"Generative adversarial nets","volume":"27","author":"Goodfellow","year":"2014","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_3","unstructured":"Kipf, T.N., and Welling, M. (2016). Semi-supervised classification with graph convolutional networks. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","article-title":"Long short-term memory","volume":"9","author":"Hochreiter","year":"1997","journal-title":"Neural Comput."},{"key":"ref_5","first-page":"155","article-title":"Support vector regression machines","volume":"9","author":"Drucker","year":"1996","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00994018","article-title":"Support-vector networks","volume":"20","author":"Cortes","year":"1995","journal-title":"Mach. Learn."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0925-2312(03)00372-2","article-title":"Financial time series forecasting using support vector machines","volume":"55","author":"Kim","year":"2003","journal-title":"Neurocomputing"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0305-0483(01)00026-3","article-title":"Application of support vector machines in financial time series forecasting","volume":"29","author":"Tay","year":"2001","journal-title":"Omega"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Hao, W., and Yu, S. (2006). Support vector regression for financial time series forecasting. International Conference on Programming Languages for Manufacturing, Springer.","DOI":"10.1007\/0-387-34403-9_115"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00704-012-0661-7","article-title":"Least squares support vector machine for short-term prediction of meteorological time series","volume":"111","author":"Mellit","year":"2013","journal-title":"Theor. Appl. Climatol."},{"key":"ref_11","unstructured":"Zivot, E., and Wang, J. (2006). Vector autoregressive models for multivariate time series. Modeling Financial Time Series with S-PLUS\u00ae, Springer."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Chai, D., Wang, L., and Yang, Q. (2018, January 6\u20139). Bike flow prediction with multi-graph convolutional networks. Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Seattle, WA, USA.","DOI":"10.1145\/3274895.3274896"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3848","DOI":"10.1109\/TITS.2019.2935152","article-title":"T-gcn: A temporal graph convolutional network for traffic prediction","volume":"21","author":"Zhao","year":"2019","journal-title":"IEEE Trans. Intell. Transp. Syste."},{"key":"ref_14","unstructured":"Luo, Y., Cai, X., Zhang, Y., and Xu, J. (2021, January 25). Multivariate Time Series Imputation with Generative Adversarial Networks. Advances in Neural Information Processing Systems. Available online: https:\/\/papers.nips.cc\/paper\/7432-multivariate-time-series-imputation-with-generative-adversarial-networks."},{"key":"ref_15","unstructured":"Bruna, J., Zaremba, W., Szlam, A., and LeCun, Y. (2013). Spectral networks and locally connected networks on graphs. arXiv."},{"key":"ref_16","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume":"29","author":"Defferrard","year":"2016","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Yao, L., Mao, C., and Luo, Y. (2019, January 5). Graph convolutional networks for text classification. Proceedings of the AAAI Conference on Artificial Intelligence, Honolulu, HI, USA.","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.media.2018.06.001","article-title":"Disease prediction using graph convolutional networks: Application to Autism Spectrum Disorder and Alzheimer\u2019s disease","volume":"48","author":"Parisot","year":"2018","journal-title":"Med. Image Anal."},{"key":"ref_19","unstructured":"Radford, A., Metz, L., and Chintala, S. (2015). Unsupervised representation learning with deep convolutional generative adversarial networks. arXiv."},{"key":"ref_20","unstructured":"Dumoulin, V., and Visin, F. (2016). A guide to convolution arithmetic for deep learning. arXiv."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2673","DOI":"10.1109\/78.650093","article-title":"Bidirectional recurrent neural networks","volume":"45","author":"Schuster","year":"1997","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_22","unstructured":"Kingma, D.P., and Ba, J. (2014). Adam: A method for stochastic optimization. arXiv."},{"key":"ref_23","unstructured":"Hinton, G.E., Srivastava, N., Krizhevsky, A., Sutskever, I., and Salakhutdinov, R.R. (2012). Improving neural networks by preventing co-adaptation of feature detectors. arXiv."},{"key":"ref_24","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref_25","first-page":"3146","article-title":"Lightgbm: A highly efficient gradient boosting decision tree","volume":"30","author":"Ke","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Cho, K., Van Merri\u00ebnboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., and Bengio, Y. (2014). Learning phrase representations using RNN encoder-decoder for statistical machine translation. arXiv.","DOI":"10.3115\/v1\/D14-1179"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/12\/2\/55\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:15:34Z","timestamp":1760159734000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/12\/2\/55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,26]]},"references-count":26,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,2]]}},"alternative-id":["info12020055"],"URL":"https:\/\/doi.org\/10.3390\/info12020055","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2021,1,26]]}}}