{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:25:09Z","timestamp":1768533909166,"version":"3.49.0"},"reference-count":44,"publisher":"Oxford University Press (OUP)","issue":"7","license":[{"start":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T00:00:00Z","timestamp":1738713600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"publisher","award":["62172299"],"award-info":[{"award-number":["62172299"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Shanghai Science and Technology Committee","doi-asserted-by":"publisher","award":["22511105500"],"award-info":[{"award-number":["22511105500"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Self-supervised learning (SSL) has become a promising and popular learning paradigm for graph data, offering the advantage of capturing informative knowledge without reliance on manual labels. As a representative class of generative graph SSL models, existing graph autoencoders (GAE) excel in link prediction tasks and are steadily improving in node classification tasks. However, GAE is essentially based on the Information Maximization (InfoMax) principle, always captures much redundant information. In this paper, we propose an Alternating-update-strategy based Graph Autoencoder, including alternating update module (AUM) and GAE. For AUM, we design an Alternating-update-strategy to generate a new graph with reduced redundancy, in order to reduce the amount of redundant information that the encoder may capture. For GAE, we feed it the new graph and employ a re-mask decoding strategy to generate node representations. Our model is evaluated on five common real-world datasets for the node classification task, and the experimental results demonstrate its superiority. Meanwhile, our model has also achieved excellent results in specific e-commerce warehousing application scenarios.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf007","type":"journal-article","created":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T07:15:10Z","timestamp":1737789310000},"page":"830-838","source":"Crossref","is-referenced-by-count":1,"title":["Alternating-update-strategy based Graph Autoencoder for graph neural network"],"prefix":"10.1093","volume":"68","author":[{"given":"Lingxiao","family":"Shan","sequence":"first","affiliation":[{"name":"School of Mathematics and Computer science , Zhejiang A&F University, Hangzhou 311300,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer science , Zhejiang A&F University, Hangzhou 311300,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanjun","family":"Liu","sequence":"additional","affiliation":[{"name":"The Key Laboratory of Embedded System and Service Computing of Ministry of Education , Tongji University, Shanghai 201804,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"key":"2025071900315839900_ref1","doi-asserted-by":"publisher","first-page":"2393","DOI":"10.1093\/comjnl\/bxac086","article-title":"Multi-view spatial\u2013temporal graph neural network for traffic prediction","volume":"66","author":"Li","year":"2023","journal-title":"Comput J"},{"key":"2025071900315839900_ref2","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1093\/comjnl\/bxad085","article-title":"Knowledge-aware dual-channel graph neural networks for denoising recommendation","volume":"67","author":"Zhang","year":"2024","journal-title":"Comput J"},{"key":"2025071900315839900_ref3","first-page":"1","article-title":"Graph neural network for credit card fraud detection","volume-title":"Proceedings of the 2021 International Conference on Cyber-Physical Social Intelligence (ICCSI)","author":"Liu","year":"2021, ,"},{"key":"2025071900315839900_ref4","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS)","author":"Hamilton","year":"2017,   .,   ,"},{"key":"2025071900315839900_ref5","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1093\/comjnl\/bxab064","article-title":"Robust and dynamic graph convolutional network for multi-view data classification","volume":"64","author":"Peng","year":"2021","journal-title":"Comput J"},{"key":"2025071900315839900_ref6","doi-asserted-by":"publisher","first-page":"3536","DOI":"10.1109\/TCSS.2023.3335485","article-title":"ASA-GNN: adaptive sampling and aggregation-based graph neural network for transaction fraud detection","volume":"11","author":"Tian","year":"2024","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"2025071900315839900_ref7","doi-asserted-by":"publisher","first-page":"12659","DOI":"10.1109\/TII.2024.3423447","article-title":"Spatial-temporal-aware graph transformer for transaction fraud detection","volume":"20","author":"Tian","year":"2024","journal-title":"IEEE Trans Industr Inform"},{"key":"2025071900315839900_ref8","first-page":"3670","article-title":"Attributed graph clustering: a deep attentional embedding approach","volume-title":"Proceedings of the 28th international joint conference on artificial intelligence (IJCAI)","author":"Wang","year":"2019, , ,"},{"key":"2025071900315839900_ref9","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1611.07308","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"2025071900315839900_ref10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2022.3172903","article-title":"Graph self-supervised learning: a survey","volume":"35","author":"Liu","year":"2022","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2025071900315839900_ref11","first-page":"2609","article-title":"Adversarially regularized graph autoencoder for graph embedding","volume-title":"Proceedings of the 27th international joint conference on artificial intelligence (IJCAI)","author":"Pan","year":"2018"},{"key":"2025071900315839900_ref12","first-page":"625","article-title":"Bring your own view: graph neural networks for link prediction with personalized subgraph selection","volume-title":"Proceedings of the 16th ACM International Conference on Web Search and Data Mining (WSDM)","author":"Tan","year":"2023, , ,"},{"key":"2025071900315839900_ref13","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1145\/3132847.3132967","article-title":"MGAE: marginalized graph autoencoder for graph clustering","volume-title":"Proceedings of the 2017 ACM on Conference on Information and Knowledge Management (CIKM)","author":"Wang","year":"2017, , ,"},{"key":"2025071900315839900_ref14","first-page":"393","article-title":"Co-embedding attributed networks","volume-title":"Proceedings of the 12th ACM International Conference on Web Search and Data Mining (WSDM)","author":"Meng","year":"2019, ,  ,"},{"key":"2025071900315839900_ref15","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1145\/3394486.3403168","article-title":"GCC: graph contrastive coding for graph neural network pre-training","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD)","author":"Qiu","year":"2020, ,   ,"},{"key":"2025071900315839900_ref16","volume-title":"Deep Graph Infomax.","author":"Velickovic"},{"key":"2025071900315839900_ref17","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1145\/3394486.3403237","article-title":"GPT-GNN: generative pre-training of graph neural networks","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD)","author":"Hu","year":"2020, ,   ,"},{"key":"2025071900315839900_ref18","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/3534678.3539321","article-title":"GraphMAE: self-supervised masked graph autoencoders","volume-title":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)","author":"Hou","year":"2022"},{"key":"2025071900315839900_ref19","doi-asserted-by":"publisher","first-page":"6305","DOI":"10.1109\/TKDE.2024.3388728","article-title":"Graph contrastive learning with personalized augmentation","volume":"36","author":"Zhang","year":"2024","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2025071900315839900_ref20","first-page":"787","article-title":"S2GAE: self-supervised graph autoencoders are generalizable learners with graph masking","volume-title":"Proceedings of the 16th ACM International Conference on Web Search and Data Mining (WSDM)","author":"Tan","year":"2023"},{"key":"2025071900315839900_ref21","doi-asserted-by":"publisher","article-title":"MaskGAE: masked graph modeling meets graph autoencoders.","author":"Li","DOI":"10.48550\/arXiv.2205.10053"},{"key":"2025071900315839900_ref22","article-title":"On mutual information maximization for representation learning","volume-title":"Proceedings of the 8th International Conference on Learning Representations (ICLR)","author":"Tschannen","year":"2020, , ."},{"key":"2025071900315839900_ref23","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1109\/TCSS.2023.3239034","article-title":"A heterogeneous graph neural network with attribute enhancement and structure-aware attention","volume":"11","author":"Fan","year":"2023","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"2025071900315839900_ref24","doi-asserted-by":"publisher","article-title":"The information bottleneck method","author":"Tishby","DOI":"10.48550\/arXiv.physics\/0004057"},{"key":"2025071900315839900_ref25","first-page":"1","article-title":"Deep learning and the information bottleneck principle","volume-title":"Proceedings of the 2015 IEEE Information Theory Workshop (ITW)","author":"Tishby","year":"2015, ,  ,"},{"key":"2025071900315839900_ref26","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/JSAIT.2020.2991561","article-title":"The information bottleneck problem and its applications in machine learning","volume":"1","author":"Goldfeld","year":"2020","journal-title":"IEEE J Sel Areas Inf Theory"},{"key":"2025071900315839900_ref27","first-page":"20437","article-title":"Graph information bottleneck","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems (NIPS)","author":"Wu","year":"2020,   .,  ,"},{"key":"2025071900315839900_ref28","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1109\/TPAMI.2021.3112205","article-title":"Recognizing predictive substructures with subgraph information bottleneck","volume":"46","author":"Yu","year":"2024","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2025071900315839900_ref29","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1145\/3394486.3403140","article-title":"Adaptive graph encoder for attributed graph embedding","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD)","author":"Cui","year":"2020, ,   ,"},{"key":"2025071900315839900_ref30","first-page":"6519","article-title":"Symmetric graph convolutional autoencoder for unsupervised graph representation learning","volume-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision (ICCV)","author":"Park","year":"2019, , ,"},{"key":"2025071900315839900_ref31","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/3575637.3575646","article-title":"Data augmentation for deep graph learning: a survey","volume":"24","author":"Ding","year":"2022","journal-title":"ACM SIGKDD Explor Newslett"},{"key":"2025071900315839900_ref32","doi-asserted-by":"publisher","article-title":"Graph data augmentation for graph machine learning: a survey","author":"Zhao","DOI":"10.48550\/arXiv.2202.08871"},{"key":"2025071900315839900_ref33","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems (NIPS)","author":"You","year":"2020,   .,  ,"},{"key":"2025071900315839900_ref34","first-page":"30414","article-title":"InfoGCL: information-aware graph contrastive learning","volume-title":"Proceedings of the 35th International Conference on Neural Information Processing Systems (NIPS)","author":"Xu","year":"2021,   .,  ,"},{"key":"2025071900315839900_ref35","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2006.04131","article-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020"},{"key":"2025071900315839900_ref36","first-page":"76","article-title":"From canonical correlation analysis to self-supervised graph neural networks","volume-title":"Proceedings of the 35th International Conference on Neural Information Processing Systems (NIPS)","author":"Zhang","year":"2021,   .,  ,"},{"key":"2025071900315839900_ref37","first-page":"22092","article-title":"Graph random neural networks for semi-supervised learning on graphs","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems (NIPS)","author":"Feng","year":"2020,   .,  ,"},{"key":"2025071900315839900_ref38","article-title":"Graph information bottleneck for subgraph recognition","volume-title":"Proceedings of the 9th International Conference on Learning Representations (ICLR)","author":"Yu","year":"2021, , ."},{"key":"2025071900315839900_ref39","article-title":"Graph attention networks","volume-title":"Proceedings of the 6th International Conference on Learning Representations (ICLR)","author":"Veli\u010dkovi\u0107","year":"2018, , ."},{"key":"2025071900315839900_ref40","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1145\/3534678.3539484","article-title":"Reliable representations make a stronger defender: unsupervised structure refinement for robust GNN","volume-title":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)","author":"Li","year":"2022, ,  ,"},{"key":"2025071900315839900_ref41","first-page":"989","article-title":"Graph attention auto-encoders","volume-title":"Proceedings of the 2020 32nd International Conference on Tools with Artificial Intelligence (ICTAI)","author":"Salehi","year":"2020, ,  ,"},{"key":"2025071900315839900_ref42","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/3543507.3583245","article-title":"SeeGera: self-supervised semi-implicit graph variational auto-encoders with masking","volume-title":"Proceedings of the ACM Web Conference 2023 (WWW)","author":"Li","year":"2023, ,  ,"},{"key":"2025071900315839900_ref43","first-page":"15528","article-title":"Rethinking graph masked autoencoders through alignment and uniformity","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI)","author":"Wang","year":"2024, , ,"},{"key":"2025071900315839900_ref44","doi-asserted-by":"publisher","first-page":"6154","DOI":"10.3390\/su13116154","article-title":"Designing a multi-stage transport system serving e-commerce activity","volume":"13","author":"Burinskien\u0117","year":"2021","journal-title":"Sustainability"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/7\/830\/61762533\/bxaf007.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/7\/830\/61762533\/bxaf007.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,19]],"date-time":"2025-07-19T04:32:06Z","timestamp":1752899526000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/7\/830\/8001803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,5]]},"references-count":44,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,2,5]]},"published-print":{"date-parts":[[2025,7,16]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf007","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,7]]},"published":{"date-parts":[[2025,2,5]]}}}