{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T03:44:21Z","timestamp":1783568661237,"version":"3.55.0"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T00:00:00Z","timestamp":1711411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>Graph contrastive learning has made remarkable achievements in the self-supervised representation learning of graph-structured data. By employing perturbation function (i.e., perturbation on the nodes or edges of graph), most graph contrastive learning methods construct contrastive samples on the original graph. However, the perturbation-based data augmentation methods randomly change the inherent information (e.g., attributes or structures) of the graph. Therefore, after nodes embedding on the perturbed graph, we cannot guarantee the validity of the contrastive samples as well as the learned performance of graph contrastive learning. To this end, in this article, we propose a novel generation-based multi-view contrastive learning framework (GMVC) for self-supervised graph representation learning, which generates the contrastive samples based on our generator rather than perturbation function. Specifically, after nodes embedding on the original graph we first employ random walk in the neighborhood to develop multiple relevant node sequences for each anchor node. We then utilize the transformer to generate the representations of relevant contrastive samples of anchor node based on the features and structures of the sampled node sequences. Finally, by maximizing the consistency between the anchor view and the generated views, we force the model to effectively encode graph information into nodes embeddings. We perform extensive experiments of node classification and link prediction tasks on eight benchmark datasets, which verify the effectiveness of our generation-based multi-view graph contrastive learning method.<\/jats:p>","DOI":"10.1145\/3645095","type":"journal-article","created":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T11:53:42Z","timestamp":1707479622000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Generation-based Multi-view Contrast for Self-supervised Graph Representation Learning"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6099-1673","authenticated-orcid":false,"given":"Yuehui","family":"Han","sequence":"first","affiliation":[{"name":"Nanjing University of Science and Technology, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,3,26]]},"reference":[{"key":"e_1_3_3_2_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Carlsson Fredrik","year":"2020","unstructured":"Fredrik Carlsson, Amaru Cuba Gyllensten, Evangelia Gogoulou, Erik Ylip\u00e4\u00e4 Hellqvist, and Magnus Sahlgren. 2020. Semantic re-tuning with contrastive tension. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036"},{"key":"e_1_3_3_4_2","unstructured":"Vijay Prakash Dwivedi and Xavier Bresson. 2021. A generalization of transformer networks to graphs. arXiv:2012.09699 [cs.LG]."},{"key":"e_1_3_3_5_2","unstructured":"Evgeniy Faerman Otto Voggenreiter Felix Borutta Tobias Emrich Max Berrendorf and Matthias Schubert. 2019. Graph alignment networks with node matching scores. Proceedings of Advances in Neural Information Processing Systems (NIPS) 2 (2019)."},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_3_7_2","unstructured":"Hakim Hafidi Mounir Ghogho Philippe Ciblat and Ananthram Swami. 2020. GraphCL: Contrastive self-supervised learning of graph representations. arXiv:2007.08025 [cs.LG]."},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01588-5"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294869"},{"key":"e_1_3_3_10_2","unstructured":"William L. Hamilton Rex Ying and Jure Leskovec. 2018. Representation learning on graphs: methods and applications. arXiv:1709.05584 [cs.SI]."},{"key":"e_1_3_3_11_2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-031-20056-4_6","volume-title":"Proceedings of the 17th European Conference on Computer Vision\u2013ECCV 2022","author":"Han Yuehui","year":"2022","unstructured":"Yuehui Han, Le Hui, Haobo Jiang, Jianjun Qian, and Jin Xie. 2022. Generative subgraph contrast for self-supervised graph representation learning. In Proceedings of the 17th European Conference on Computer Vision\u2013ECCV 2022. Springer, 91\u2013107."},{"key":"e_1_3_3_12_2","first-page":"4116","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Hassani Kaveh","year":"2020","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. In Proceedings of the International Conference on Machine Learning. PMLR, 4116\u20134126."},{"key":"e_1_3_3_13_2","unstructured":"R. Devon Hjelm Alex Fedorov Samuel Lavoie-Marchildon Karan Grewal Phil Bachman Adam Trischler and Yoshua Bengio. 2019. Learning deep representations by mutual information estimation and maximization. arXiv:1808.06670 [stat.ML]."},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.3390\/technologies9010002"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.3390\/technologies9010002"},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","unstructured":"Yizhu Jiao Yun Xiong Jiawei Zhang Yao Zhang Tianqi Zhang and Yangyong Zhu. 2020. Sub-graph contrast for scalable self-supervised graph representation learning. arXiv:2009.10273 [cs.LG].","DOI":"10.1109\/ICDM50108.2020.00031"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/3204880"},{"key":"e_1_3_3_18_2","unstructured":"Diederik P. Kingma and Jimmy Ba. 2017. Adam: A method for stochastic optimization. arXiv:1412.6980 [cs.LG]."},{"key":"e_1_3_3_19_2","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907 [cs.LG]."},{"key":"e_1_3_3_20_2","first-page":"3734","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Lee Junhyun","year":"2019","unstructured":"Junhyun Lee, Inyeop Lee, and Jaewoo Kang. 2019. Self-attention graph pooling. In Proceedings of the International Conference on Machine Learning. PMLR, 3734\u20133743."},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-022-01639-z"},{"key":"e_1_3_3_22_2","unstructured":"Yijie Lin Yuanbiao Gou Xiaotian Liu Jinfeng Bai Jiancheng Lv and Xi Peng. 2022. Dual contrastive prediction for incomplete multi-view representation learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 45 4 (2022) 4447\u20134461."},{"key":"e_1_3_3_23_2","first-page":"16211","article-title":"Random walk graph neural networks","volume":"33","author":"Nikolentzos Giannis","year":"2020","unstructured":"Giannis Nikolentzos and Michalis Vazirgiannis. 2020. Random walk graph neural networks. Advances in Neural Information Processing Systems 33 (2020), 16211\u201316222.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380112"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"e_1_3_3_29_2","unstructured":"Oleksandr Shchur Maximilian Mumme Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Pitfalls of graph neural network evaluation. arXiv:1811.05868 [cs.LG]."},{"key":"e_1_3_3_30_2","unstructured":"Fan-Yun Sun Jordan Hoffmann Vikas Verma and Jian Tang. 2020. InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. arXiv:1908.01000 [cs.LG]."},{"key":"e_1_3_3_31_2","unstructured":"Susheel Suresh Pan Li Cong Hao and Jennifer Neville. 2021. Adversarial graph augmentation to improve graph contrastive learning. arXiv:2106.05819 [cs.LG]."},{"key":"e_1_3_3_32_2","unstructured":"Zekun Tong Yuxuan Liang Henghui Ding Yongxing Dai Xinke Li and Changhu Wang. 2021. Directed graph contrastive learning. Advances in Neural Information Processing Systems 34 (2021) 19580\u201319593."},{"key":"e_1_3_3_33_2","unstructured":"Laurens van der Maaten and Geoffrey Hinton. 2008. Visualizing Data using t-SNE. Journal of Machine Learning Research 9 86 (2008) 2579\u20132605. http:\/\/jmlr.org\/papers\/v9\/vandermaaten08a.html"},{"key":"e_1_3_3_34_2","first-page":"5998","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Proceedings of the Advances in Neural Information Processing Systems. 5998\u20136008."},{"key":"e_1_3_3_35_2","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. arXiv:1710.10903 [stat.ML]."},{"key":"e_1_3_3_36_2","unstructured":"Petar Veli\u010dkovi\u0107 William Fedus William L. Hamilton Pietro Li\u00f2 Yoshua Bengio and R. Devon Hjelm. 2018. Deep graph infomax. arXiv:1809.10341 [stat.ML]."},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","unstructured":"Qianqian Wang Zhiqiang Tao Wei Xia Quanxue Gao Xiaochun Cao and Licheng Jiao. 2023. Adversarial multiview clustering networks with adaptive fusion. IEEE Transactions on Neural Networks and Learning Systems 34 10 (2023) 7635\u20137647. 10.1109\/TNNLS.2022.3145048","DOI":"10.1109\/TNNLS.2022.3145048"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449786"},{"key":"e_1_3_3_39_2","doi-asserted-by":"crossref","unstructured":"Yanling Wang Jing Zhang Haoyang Li Yuxiao Dong Hongzhi Yin Cuiping Li and Hong Chen. 2022. ClusterSCL: cluster-aware supervised contrastive learning on graphs. In Proceedings of the ACM Web Conference 2022. 1611\u20131621.","DOI":"10.1145\/3485447.3512207"},{"key":"e_1_3_3_40_2","first-page":"0","volume-title":"Proceedings of the European Conference on Computer Vision (ECCV) Workshops","author":"Wen Jie","year":"2018","unstructured":"Jie Wen, Zheng Zhang, Yong Xu, and Zuofeng Zhong. 2018. Incomplete multi-view clustering via graph regularized matrix factorization. In Proceedings of the European Conference on Computer Vision (ECCV) Workshops. 0\u20130."},{"key":"e_1_3_3_41_2","unstructured":"Lirong Wu Haitao Lin Zhangyang Gao Cheng Tan and Stan. Z. Li. 2021. Self-supervised learning on graphs: contrastive generative or predictive. arXiv:2105.07342 [cs.LG]."},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","unstructured":"Jun Xia Lirong Wu Jintao Chen Bozhen Hu and Stan Z. Li. 2022. SimGRACE: A simple framework for graph contrastive learning without data augmentation. In Proceedings of the ACM Web Conference 2022 (WWW\u201922). ACM. 10.1145\/3485447.3512156","DOI":"10.1145\/3485447.3512156"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","unstructured":"Wei Xia Qianqian Wang Quanxue Gao Ming Yang and Xinbo Gao. 2023. Self-consistent contrastive attributed graph clustering with pseudo-label prompt. IEEE Transactions on Multimedia 25 (2023) 6665\u20136677. 10.1109\/TMM.2022.3213208","DOI":"10.1109\/TMM.2022.3213208"},{"key":"e_1_3_3_45_2","doi-asserted-by":"crossref","unstructured":"Wei Xia Tianxiu Wang Quanxue Gao Ming Yang and Xinbo Gao. 2023. Graph embedding contrastive multi-modal representation learning for clustering. IEEE Transactions on Image Processing 32 (2023) 1170\u20131183.","DOI":"10.1109\/TIP.2023.3240863"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","unstructured":"Ben Yang Xuetao Zhang Badong Chen Feiping Nie Zhiping Lin and Zhixiong Nan. 2022. Efficient correntropy-based multi-view clustering with anchor graph embedding. Neural Netw. 146 C (Feb 2022) 290\u2013302. 10.1016\/j.neunet.2021.11.027","DOI":"10.1016\/j.neunet.2021.11.027"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3155499"},{"key":"e_1_3_3_48_2","unstructured":"Yihang Yin Qingzhong Wang Siyu Huang Haoyi Xiong and Xiang Zhang. 2022. AutoGCL: Automated graph contrastive learning via learnable view generators. arXiv:2109.10259 [cs.LG]."},{"key":"e_1_3_3_49_2","unstructured":"Yuning You Tianlong Chen Yang Shen and Zhangyang Wang. 2021. Graph contrastive learning automated. arXiv:2106.07594 [cs.LG]."},{"key":"e_1_3_3_50_2","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph contrastive learning with augmentations. Advances in Neural Information Processing Systems 33 (2020), 5812\u20135823.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","unstructured":"Yuning You Tianlong Chen Zhangyang Wang and Yang Shen. 2022. Bringing your own view: graph contrastive learning without prefabricated data augmentations. In Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining (WSDM\u201922). ACM. 10.1145\/3488560.3498416","DOI":"10.1145\/3488560.3498416"},{"key":"e_1_3_3_52_2","first-page":"11983","article-title":"Graph transformer networks","volume":"32","author":"Yun Seongjun","year":"2019","unstructured":"Seongjun Yun, Minbyul Jeong, Raehyun Kim, Jaewoo Kang, and Hyunwoo J. Kim. 2019. Graph transformer networks. Advances in Neural Information Processing Systems 32 (2019), 11983\u201311993.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2018.2850013"},{"key":"e_1_3_3_54_2","first-page":"5165","article-title":"Link prediction based on graph neural networks","volume":"31","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. Advances in Neural Information Processing Systems 31 (2018), 5165\u20135175.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_55_2","unstructured":"Yanqiao Zhu Yichen Xu Feng Yu Qiang Liu Shu Wu and Liang Wang. 2020. Deep graph contrastive representation learning. arXiv:2006.04131 [cs.LG]."},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3645095","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3645095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:27Z","timestamp":1750291407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3645095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,26]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,6,30]]}},"alternative-id":["10.1145\/3645095"],"URL":"https:\/\/doi.org\/10.1145\/3645095","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,26]]},"assertion":[{"value":"2022-12-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-28","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}