{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T21:48:09Z","timestamp":1781732889162,"version":"3.54.5"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T00:00:00Z","timestamp":1720828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T00:00:00Z","timestamp":1720828800000},"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":["Neural Process Lett"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In recent years, some classical graph contrastive learning(GCL) frameworks have been proposed to address the problem of sparse labeling of graph data in the real world. However, in node classification tasks, there are two obvious problems with existing GCL frameworks: first, the stochastic augmentation methods they adopt lose a lot of semantic information; second, the local\u2013local contrasting mode selected by most frameworks ignores the global semantic information of the original graph, which limits the node classification performance of these frameworks. To address the above problems, this paper proposes a novel graph contrastive learning framework, MDGCL, which introduces two graph diffusion methods, Markov and PPR, and a deterministic\u2013stochastic data augmentation strategy while retaining the local\u2013local contrasting mode. Specifically, before using the two stochastic augmentation methods (FeatureDrop and EdgeDrop), MDGCL first uses two deterministic augmentation methods (Markov diffusion and PPR diffusion) to perform data augmentation on the original graph to increase the semantic information, this step ensures subsequent stochastic augmentation methods do not lose too much semantic information. Meanwhile, the diffusion matrices carried by the augmented views contain global semantic information of the original graph, allowing the framework to utilize the global semantic information while retaining the local-local contrasting mode, which further enhances the node classification performance of the framework. We conduct extensive comparative experiments on multiple benchmark datasets, and the results show that MDGCL outperforms the representative baseline frameworks on node classification tasks. Among them, compared with COSTA, MDGCL\u2019s node classification accuracy has been improved by 1.07% and 0.41% respectively on two representative datasets, Amazon-Photo and Coauthor-CS. In addition, we also conduct ablation experiments on two datasets, Cora and CiteSeer, to verify the effectiveness of each improvement work of our framework.<\/jats:p>","DOI":"10.1007\/s11063-024-11672-3","type":"journal-article","created":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T05:01:51Z","timestamp":1720846911000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["MDGCL: Graph Contrastive Learning Framework with Multiple Graph Diffusion Methods"],"prefix":"10.1007","volume":"56","author":[{"given":"Yuqiang","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,13]]},"reference":[{"issue":"12","key":"11672_CR1","doi-asserted-by":"publisher","first-page":"10270","DOI":"10.1109\/TPAMI.2021.3134200","volume":"44","author":"M Liu","year":"2021","unstructured":"Liu M, Wang Z, Ji S (2021) Non-local graph neural networks. IEEE Trans Pattern Anal Mach Intell 44(12):10270\u201310276","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"11672_CR2","unstructured":"Huang Q, He H, Singh A, Lim S-N, Benson AR (2020) Combining label propagation and simple models out-performs graph neural networks. arXiv preprint arXiv:2010.13993"},{"key":"11672_CR3","doi-asserted-by":"crossref","unstructured":"Li J, Zheng R, Feng H, Li M, Zhuang X (2023) Permutation equivariant graph framelets for heterophilous graph learning. arXiv preprint arXiv:2306.04265","DOI":"10.1109\/TNNLS.2024.3370918"},{"issue":"3","key":"11672_CR4","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/TPAMI.2022.3183143","volume":"45","author":"C Huang","year":"2022","unstructured":"Huang C, Li M, Cao F, Fujita H, Li Z, Wu X (2022) Are graph convolutional networks with random weights feasible? IEEE Trans Pattern Anal Mach Intell 45(3):2751\u20132768","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"11672_CR5","unstructured":"Knyazev B, Taylor GW, Amer M (2019) Understanding attention and generalization in graph neural networks. Adv Neural Inf Process Syst 32"},{"key":"11672_CR6","doi-asserted-by":"crossref","unstructured":"Yao L, Mao C, Luo Y (2019) Graph convolutional networks for text classification. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 7370\u20137377","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"11672_CR7","doi-asserted-by":"crossref","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) Lightgcn: Simplifying and powering graph convolution network for recommendation. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 639\u2013648","DOI":"10.1145\/3397271.3401063"},{"key":"11672_CR8","unstructured":"Zhang M, Chen Y (2018) Link prediction based on graph neural networks. Adv Neural Inf Process Syst 31"},{"key":"11672_CR9","doi-asserted-by":"crossref","unstructured":"Jin D, Liu Z, Li W, He D, Zhang W (2019) Graph convolutional networks meet markov random fields: Semi-supervised community detection in attribute networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 152\u2013159","DOI":"10.1609\/aaai.v33i01.3301152"},{"key":"11672_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109874","volume":"144","author":"M Li","year":"2023","unstructured":"Li M, Zhang L, Cui L, Bai L, Li Z, Wu X (2023) Blog: Bootstrapped graph representation learning with local and global regularization for recommendation. Pattern Recogn 144:109874","journal-title":"Pattern Recogn"},{"key":"11672_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2024.102224","volume":"105","author":"M Li","year":"2024","unstructured":"Li M, Zhuang X, Bai L, Ding W (2024) Multimodal graph learning based on 3d haar semi-tight framelet for student engagement prediction. Inf Fusion 105:102224","journal-title":"Inf Fusion"},{"issue":"3","key":"11672_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/2.36","volume":"21","author":"R Linsker","year":"1988","unstructured":"Linsker R (1988) Self-organization in a perceptual network. Computer 21(3):105\u2013117","journal-title":"Computer"},{"key":"11672_CR13","unstructured":"Bachman P, Hjelm RD, Buchwalter W (2019) Learning representations by maximizing mutual information across views. Adv Neural Inf Process Syst 32"},{"key":"11672_CR14","doi-asserted-by":"crossref","unstructured":"He K, Fan H, Wu Y, Xie S, Girshick R (2020) Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 9729\u20139738","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"11672_CR15","doi-asserted-by":"crossref","unstructured":"Tian Y, Krishnan D, Isola P (2020) Contrastive multiview coding. In: Computer Vision\u2013ECCV 2020: 16th European Conference, Glasgow, UK, August 23\u201328, 2020, Proceedings, Part XI 16, pp. 776\u2013794. Springer","DOI":"10.1007\/978-3-030-58621-8_45"},{"key":"11672_CR16","doi-asserted-by":"crossref","unstructured":"Collobert R, Weston J (2008) A unified architecture for natural language processing: Deep neural networks with multitask learning. In: Proceedings of the 25th International Conference on Machine Learning, pp. 160\u2013167","DOI":"10.1145\/1390156.1390177"},{"key":"11672_CR17","unstructured":"Mnih A, Kavukcuoglu K (2013) Learning word embeddings efficiently with noise-contrastive estimation. Adv Neural Inf Process Syst 26"},{"key":"11672_CR18","unstructured":"Hjelm RD, Fedorov A, Lavoie-Marchildon S, Grewal K, Bachman P, Trischler A, Bengio Y (2018) Learning deep representations by mutual information estimation and maximization. arXiv preprint arXiv:1808.06670"},{"key":"11672_CR19","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 Inf Process Syst 33:5812\u20135823","journal-title":"Adv Neural Inf Process Syst"},{"issue":"3","key":"11672_CR20","first-page":"4","volume":"2","author":"P Velickovic","year":"2019","unstructured":"Velickovic P, Fedus W, Hamilton WL, Li\u00f2 P, Bengio Y, Hjelm RD (2019) Deep graph infomax. ICLR (Poster) 2(3):4","journal-title":"ICLR (Poster)"},{"key":"11672_CR21","doi-asserted-by":"crossref","unstructured":"Zhu Y, Xu Y, Liu Q, Wu S (2021) An empirical study of graph contrastive learning. arXiv preprint arXiv:2109.01116","DOI":"10.1145\/3442381.3449802"},{"key":"11672_CR22","unstructured":"You Y, Chen T, Wang Z, Shen Y (2020) When does self-supervision help graph convolutional networks? In: International Conference on Machine Learning, pp. 10871\u201310880. PMLR"},{"key":"11672_CR23","unstructured":"Jin W, Derr T, Liu H, Wang Y, Wang S, Liu Z, Tang J (2020) Self-supervised learning on graphs: Deep insights and new direction. arXiv preprint arXiv:2006.10141"},{"key":"11672_CR24","doi-asserted-by":"crossref","unstructured":"Sun K, Lin Z, Zhu Z (2020) Multi-stage self-supervised learning for graph convolutional networks on graphs with few labeled nodes. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 5892\u20135899","DOI":"10.1609\/aaai.v34i04.6048"},{"key":"11672_CR25","doi-asserted-by":"crossref","unstructured":"Caron M, Bojanowski P, Joulin A, Douze M (2018) Deep clustering for unsupervised learning of visual features. In: Proceedings of the European Conference on Computer Vision (ECCV), pp. 132\u2013149","DOI":"10.1007\/978-3-030-01264-9_9"},{"key":"11672_CR26","unstructured":"Zhu Y, Xu Y, Yu F, Liu Q, Wu S, Wang L (2020) Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131"},{"key":"11672_CR27","doi-asserted-by":"crossref","unstructured":"Zhu Y, Xu Y, Yu F, Liu Q, Wu S, Wang L (2021) Graph contrastive learning with adaptive augmentation. In: Proceedings of the Web Conference 2021, pp. 2069\u20132080","DOI":"10.1145\/3442381.3449802"},{"key":"11672_CR28","doi-asserted-by":"crossref","unstructured":"Shen X, Sun D, Pan S, Zhou X, Yang LT (2023) Neighbor contrastive learning on learnable graph augmentation. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, pp. 9782\u20139791","DOI":"10.1609\/aaai.v37i8.26168"},{"key":"11672_CR29","doi-asserted-by":"crossref","unstructured":"Xia J, Wu L, Chen J, Hu B, Li SZ (2022) Simgrace: A simple framework for graph contrastive learning without data augmentation. In: Proceedings of the ACM Web Conference 2022, pp. 1070\u20131079","DOI":"10.1145\/3485447.3512156"},{"key":"11672_CR30","doi-asserted-by":"crossref","unstructured":"Gong X, Yang C, Shi C (2023) Ma-gcl: Model augmentation tricks for graph contrastive learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, pp. 4284\u20134292","DOI":"10.1609\/aaai.v37i4.25547"},{"key":"11672_CR31","doi-asserted-by":"crossref","unstructured":"Zhang Y, Zhu H, Song Z, Koniusz P, King I (2022) Costa: Covariance-preserving feature augmentation for graph contrastive learning. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2524\u20132534","DOI":"10.1145\/3534678.3539425"},{"key":"11672_CR32","unstructured":"Gasteiger J, Wei\u00dfenberger S, G\u00fcnnemann S (2019) Diffusion improves graph learning. Advances in neural information processing systems 32"},{"key":"11672_CR33","first-page":"23321","volume":"34","author":"J Zhao","year":"2021","unstructured":"Zhao J, Dong Y, Ding M, Kharlamov E, Tang J (2021) Adaptive diffusion in graph neural networks. Adv Neural Inf Process Syst 34:23321\u201323333","journal-title":"Adv Neural Inf Process Syst"},{"key":"11672_CR34","unstructured":"Hassani K, Khasahmadi AH (2020) Contrastive multi-view representation learning on graphs. In: International Conference on Machine Learning, pp. 4116\u20134126. PMLR"},{"key":"11672_CR35","doi-asserted-by":"crossref","unstructured":"Li Q, Han Z, Wu X-M (2018) Deeper insights into graph convolutional networks for semi-supervised learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"11672_CR36","unstructured":"Xu K, Li C, Tian Y, Sonobe T, Kawarabayashi K-i, Jegelka S (2018) Representation learning on graphs with jumping knowledge networks. In: International Conference on Machine Learning, pp. 5453\u20135462. PMLR"},{"key":"11672_CR37","unstructured":"Rong Y, Huang W, Xu T, Huang J (2019) Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903"},{"key":"11672_CR38","unstructured":"Chen T, Kornblith S, Norouzi M, Hinton G (2020) A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning, pp. 1597\u20131607. PMLR"},{"key":"11672_CR39","unstructured":"Oord Avd, Li Y, Vinyals O (2018) Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748"},{"key":"11672_CR40","unstructured":"Poole B, Ozair S, Van Den Oord A, Alemi A, Tucker G (2019) On variational bounds of mutual information. In: International Conference on Machine Learning, pp. 5171\u20135180. PMLR"},{"key":"11672_CR41","doi-asserted-by":"crossref","unstructured":"Feng S, Jing B, Zhu Y, Tong H (2022) Adversarial graph contrastive learning with information regularization. In: Proceedings of the ACM Web Conference 2022, pp. 1362\u20131371","DOI":"10.1145\/3485447.3512183"},{"key":"11672_CR42","doi-asserted-by":"crossref","unstructured":"Peng Z, Huang W, Luo M, Zheng Q, Rong Y, Xu T, Huang J (2020) Graph representation learning via graphical mutual information maximization. In: Proceedings of The Web Conference 2020, pp. 259\u2013270","DOI":"10.1145\/3366423.3380112"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11672-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-024-11672-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11672-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T16:10:51Z","timestamp":1725120651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-024-11672-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,13]]},"references-count":42,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["11672"],"URL":"https:\/\/doi.org\/10.1007\/s11063-024-11672-3","relation":{},"ISSN":["1573-773X"],"issn-type":[{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,13]]},"assertion":[{"value":"1 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"213"}}