{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T14:22:06Z","timestamp":1771510926429,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T00:00:00Z","timestamp":1718409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T00:00:00Z","timestamp":1718409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Graph augmentation plays a crucial role in graph contrastive learning. However, existing methods primarily optimize augmentations specific to particular datasets, which limits their robustness and generalization capabilities. To overcome these limitations, many studies have explored automated graph data augmentations. However, these approaches face challenges due to weak labels and data incompleteness. To tackle these challenges, we propose an innovative framework called Joint Data Augmentations for Automated Graph Contrastive Learning (JDAGCL). The proposed model first integrates two augmenters: a feature-level augmenter and an edge-level augmenter. The two augmenters learn whether to drop an edge or node to obtain optimized graph structures and enrich the information available for modeling and forecasting task. Moreover, we introduce two stage training strategy to further process the features extracted by the encoder and enhance their effectiveness for forecasting downstream task. The experimental results demonstrate that our proposed model JDAGCL achieves state-of-the-art performance compared to the latest baseline methods, with an average improvement of 14% in forecasting accuracy across multiple benchmark datasets.<\/jats:p>","DOI":"10.1007\/s40747-024-01491-3","type":"journal-article","created":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T08:02:37Z","timestamp":1718438557000},"page":"6481-6490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Joint data augmentations for automated graph contrastive learning and forecasting"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0937-0765","authenticated-orcid":false,"given":"Jiaqi","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6113-6544","authenticated-orcid":false,"given":"Yifu","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1171-7018","authenticated-orcid":false,"given":"Qianqian","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,15]]},"reference":[{"key":"1491_CR1","first-page":"5812","volume":"33","author":"Y You","year":"2020","unstructured":"You Y, Chen T, Sui Y, Chen T, Wang Z, Shen Y (2020) Graph contrastive learning with augmentations. Adv Neural Inform Process Syst 33:5812\u20135823","journal-title":"Adv Neural Inform Process Syst"},{"key":"1491_CR2","first-page":"2069","volume":"2021","author":"Y Zhu","year":"2021","unstructured":"Zhu Y, Yichen X, Feng Y, Liu Q, Shu W, Wang Liang (2021) Graph contrastive learning with adaptive augmentation. Proc Web Conf 2021:2069\u20132080","journal-title":"Proc Web Conf"},{"key":"1491_CR3","unstructured":"Zhang z, Huang X (2022) Spatial-temporal transformer network with self-supervised learning for traffic flow prediction"},{"issue":"2","key":"1491_CR4","first-page":"1580","volume":"24","author":"J Ji","year":"2023","unstructured":"Ji J, Fan Y, Lei Minglong (2023) Self-supervised spatiotemporal graph neural networks with self-distillation for traffic prediction. IEEE Trans Intell Trans Syst 24(2):1580\u20131593","journal-title":"IEEE Trans Intell Trans Syst"},{"key":"1491_CR5","unstructured":"You Y, Chen T, Shen Y, Wang Z (2021) Graph contrastive learning automated. In International Conference on Machine Learning, pages 12121\u201312132. PMLR,"},{"key":"1491_CR6","unstructured":"Jin W, Liu X, Zhao X, Ma Y, Shah N, Tang J (2021) Automated self-supervised learning for graphs. arXiv preprint arXiv:2106.05470,"},{"key":"1491_CR7","first-page":"12546","volume":"33","author":"K Chaitanya","year":"2020","unstructured":"Chaitanya K, Erdil E, Karani N, Konukoglu E (2020) Contrastive learning of global and local features for medical image segmentation with limited annotations. Adv Neural Inform Process SystA 33:12546\u201312558","journal-title":"Adv Neural Inform Process SystA"},{"key":"1491_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.media.2022.102559","volume":"81","author":"X Wang","year":"2022","unstructured":"Wang X, Yang S, Zhang J, Wang M, Zhang J, Yang W, Huang J, Han Xiao (2022) Transformer-based unsupervised contrastive learning for histopathological image classification. Med Image Anal 81:102559","journal-title":"Med Image Anal"},{"key":"1491_CR9","first-page":"11015","volume":"35","author":"T Zhao","year":"2021","unstructured":"Zhao T, Liu Y, Neves L, Woodford O, Jiang M, Shah N (2021) Data augmentation for graph neural networks. Proc aaai Conf Artificial Intell 35:11015\u201311023","journal-title":"Proc aaai Conf Artificial Intell"},{"key":"1491_CR10","doi-asserted-by":"crossref","unstructured":"Jang T, Wang X Difficulty-based sampling for debiased contrastive representation learning. In Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pages 24039\u201324048, 2023","DOI":"10.1109\/CVPR52729.2023.02302"},{"key":"1491_CR11","first-page":"8914","volume":"37","author":"Y Liu","year":"2023","unstructured":"Liu Y, Yang X, Zhou S, Liu X, Wang Z, Liang K, Wenxuan T, Li L, Duan J, Chen C (2023) Hard sample aware network for contrastive deep graph clustering. Proc AAAI Conf Artificial Intell 37:8914\u20138922","journal-title":"Proc AAAI Conf Artificial Intell"},{"key":"1491_CR12","doi-asserted-by":"crossref","unstructured":"Sun Lichao, Dou Yingtong, Yang Carl, Zhang Kai, Wang Ji (2022) S Yu Philip, Lifang He, and Bo Li. A survey. IEEE Transactions on Knowledge and Data Engineering, Adversarial attack and defense on graph data","DOI":"10.1109\/TKDE.2022.3201243"},{"key":"1491_CR13","doi-asserted-by":"crossref","unstructured":"Luo D, Cheng W, Yu W, Zong B, Ni J, Chen H, Zhang X (2021) Learning to drop: Robust graph neural network via topological denoising. In Proceedings of the 14th ACM international conference on web search and data mining, pages 779\u2013787,","DOI":"10.1145\/3437963.3441734"},{"key":"1491_CR14","first-page":"21997","volume":"34","author":"P Papp","year":"2021","unstructured":"Papp P, Martinkus K, Faber L, Wattenhofer R (2021) Dropgnn: Random dropouts increase the expressiveness of graph neural networks. Adv Neural Inform Process Syst 34:21997\u201322009","journal-title":"Adv Neural Inform Process Syst"},{"issue":"3","key":"1491_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.23919\/cje.2021.00.411","volume":"32","author":"Q Chen","year":"2023","unstructured":"Chen Q, Ye A, Zhang Q, Huang C (2023) A new edge perturbation mechanism for privacy-preserving data collection in iot. Chin J Electron 32(3):1\u201310","journal-title":"Chin J Electron"},{"issue":"6","key":"1491_CR16","doi-asserted-by":"publisher","first-page":"2170","DOI":"10.1109\/TCBB.2019.2940182","volume":"17","author":"Y Dong","year":"2019","unstructured":"Dong Y, Sun Y, Qin C, Zhu W (2019) Epmda: edge perturbation based method for mirna-disease association prediction. IEEE\/ACM Trans Comput Biol Bioinform 17(6):2170\u20132175","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"12","key":"1491_CR17","doi-asserted-by":"publisher","first-page":"3864","DOI":"10.14778\/3611540.3611571","volume":"16","author":"KS Yow","year":"2023","unstructured":"Yow KS, Liao N, Luo S, Cheng R (2023) Machine learning for subgraph extraction: Methods, applications and challenges. Proc VLDB Endowment 16(12):3864\u20133867","journal-title":"Proc VLDB Endowment"},{"key":"1491_CR18","doi-asserted-by":"crossref","unstructured":"Ge X, Yu J, Hao R (2023) Privacy-preserving graph matching query supporting quick subgraph extraction. IEEE Transactions on Dependable and Secure Computing,","DOI":"10.1109\/TDSC.2023.3276360"},{"key":"1491_CR19","first-page":"15920","volume":"34","author":"S Suresh","year":"2021","unstructured":"Suresh S, Li P, Hao C, Neville J (2021) Adversarial graph augmentation to improve graph contrastive learning. Adv Neural Inform Process Syst 34:15920\u201315933","journal-title":"Adv Neural Inform Process Syst"},{"issue":"2","key":"1491_CR20","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1109\/TSMC.2022.3186610","volume":"53","author":"R Kumar","year":"2022","unstructured":"Kumar R (2022) Memory recurrent elman neural network-based identification of time-delayed nonlinear dynamical system. IEEE Trans Syst Man Cybernet 53(2):753\u2013762","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"1491_CR21","doi-asserted-by":"crossref","unstructured":"Ding K, Xu Z, Tong H, Liu H (2022) Data augmentation for deep graph learning: A survey. sigkdd explor. newsl. 24, 2 (dec 2022), 61\u201377,","DOI":"10.1145\/3575637.3575646"},{"key":"1491_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111324","volume":"154","author":"Xihe Qiu","year":"2024","unstructured":"Qiu Xihe, Qian Jiahui, Wang Haoyu, Tan Xiaoyu, Jin Yaochu (2024) An attentive copula-based spatio-temporal graph model for multivariate time-series forecasting. Appl. Soft Comput. 154:111324","journal-title":"Appl. Soft Comput."},{"key":"1491_CR23","doi-asserted-by":"crossref","unstructured":"Rajesh K, Smriti Srivastava JRP, Gupta, (2017) Diagonal recurrent neural network based adaptive control of nonlinear dynamical systems using lyapunov stability criterion. ISA transactions 67:407\u2013427","DOI":"10.1016\/j.isatra.2017.01.022"},{"key":"1491_CR24","doi-asserted-by":"crossref","unstructured":"Liu X, Li Z, Zong W, Su H, Liu P, Ge SS (2024) Graph representation learning and optimization for spherical emission source microscopy system. IEEE Transactions on Automation Science and Engineering,","DOI":"10.1109\/TASE.2024.3375024"},{"key":"1491_CR25","unstructured":"Box GEP, Jenkins GM, Reinsel GC, Ljung GM (2015) Time series analysis: forecasting and control. John Wiley & Sons, 2015"},{"key":"1491_CR26","doi-asserted-by":"crossref","unstructured":"Castro-Neto M, Jeong YS, Jeong MK, Lee D (2009) Han. Online-svr for short-term traffic flow prediction under typical and atypical traffic conditions. Expert Systems with Applications, 36(3-part-P2):6164\u20136173,","DOI":"10.1016\/j.eswa.2008.07.069"},{"key":"1491_CR27","first-page":"1234","volume":"34","author":"C Zheng","year":"2020","unstructured":"Zheng C, Fan X, Wang C, Qi J (2020) Gman: A graph multi-attention network for traffic prediction. Proc AAAI Conf Artificial Intell 34:1234\u20131241","journal-title":"Proc AAAI Conf Artificial Intell"},{"key":"1491_CR28","doi-asserted-by":"crossref","unstructured":"Li M, Zhu (2021) Spatial-temporal fusion graph neural networks for traffic flow forecasting. Proc AAAI Conf Artificial Intell 35:4189\u20134196","DOI":"10.1609\/aaai.v35i5.16542"},{"key":"1491_CR29","doi-asserted-by":"crossref","unstructured":"Liu X, Liang Y, Huang C, Zheng Y, Hooi B, Zimmermann R (2022) When do contrastive learning signals help spatio-temporal graph forecasting? In Proceedings of the 30th International Conference on Advances in Geographic Information Systems, pages 1\u201312","DOI":"10.1145\/3557915.3560939"},{"key":"1491_CR30","unstructured":"Woo G, Liu C, Sahoo D, Kumar A, Hoi S (2022) Cost: Contrastive learning of disentangled seasonal-trend representations for time series forecasting. arXiv preprint arXiv:2202.01575,"},{"key":"1491_CR31","first-page":"22131","volume":"35","author":"Yongqiang Chen","year":"2022","unstructured":"Chen Yongqiang, Zhang Yonggang, Bian Yatao, Han Yang MA, Kaili Binghui Xie, Liu Tongliang, Han Bo, Cheng James (2022) Learning causally invariant representations for out-of-distribution generalization on graphs. Adv Neural Inform Process Syst 35:22131\u201322148","journal-title":"Adv Neural Inform Process Syst"},{"key":"1491_CR32","first-page":"4242","volume":"37","author":"Y Pan Deng","year":"2023","unstructured":"Pan Deng Y, Zhao JL, Jia X, Wang M (2023) Spatio-temporal neural structural causal models for bike flow prediction. Proc AAAI Conf Artificial Intell 37:4242\u20134249","journal-title":"Proc AAAI Conf Artificial Intell"},{"key":"1491_CR33","doi-asserted-by":"crossref","unstructured":"Zhou Z, Huang Q, Yang K, Wang K, Wang X, Zhang Y, Liang Y, Wang Y (2023) Maintaining the status quo: Capturing invariant relations for ood spatiotemporal learning. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 3603\u20133614,","DOI":"10.1145\/3580305.3599421"},{"key":"1491_CR34","first-page":"4356","volume":"37","author":"J Ji","year":"2023","unstructured":"Ji J, Wang J, Huang C, Junjie W, Boren X, Zhenhe Wu, Zhang Junbo, Zheng Yu (2023) Spatio-temporal self-supervised learning for traffic flow prediction. Proc AAAI Conf Artificial Intell 37:4356\u20134364","journal-title":"Proc AAAI Conf Artificial Intell"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01491-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01491-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01491-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T15:12:11Z","timestamp":1726326731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01491-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,15]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1491"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01491-3","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,15]]},"assertion":[{"value":"20 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}