{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T15:05:56Z","timestamp":1780931156917,"version":"3.54.1"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.patcog.2026.113986","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T23:30:04Z","timestamp":1779492604000},"page":"113986","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Convolution-aware multi-view graph contrastive learning"],"prefix":"10.1016","volume":"180","author":[{"given":"Yuhao","family":"Tao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bing","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chenglong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuchang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shiqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2026.113986_b1","unstructured":"Y. Liu, K. Liang, J. Xia, S. Zhou, X. Yang, X. Liu, S.Z. Li, Dink-net: Neural clustering on large graphs, in: International Conference on Machine Learning, 2023, pp. 21794\u201321812."},{"key":"10.1016\/j.patcog.2026.113986_b2","article-title":"Heterogeneous graph contrastive learning with spectral augmentation and dual aggregation","author":"Zhang","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113986_b3","unstructured":"M. Liu, Y. Liu, K. Liang, W. Tu, S. Wang, X. Liu, Deep Temporal Graph Clustering, in: The International Conference on Learning Representations, 2024, 2024, pp. 44277\u201344294."},{"key":"10.1016\/j.patcog.2026.113986_b4","doi-asserted-by":"crossref","unstructured":"X. Lin, R. Yang, H. Zheng, X. Ke, Spectral Subspace Clustering for Attributed Graphs, in: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V. 1, 2025, pp. 789\u2013799.","DOI":"10.1145\/3690624.3709207"},{"key":"10.1016\/j.patcog.2026.113986_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2024.102630","article-title":"Multi-view clustering via high-order bipartite graph fusion","volume":"113","author":"Zhao","year":"2025","journal-title":"Inf. Fusion"},{"issue":"2","key":"10.1016\/j.patcog.2026.113986_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3491206","article-title":"Network representation learning: from preprocessing, feature extraction to node embedding","volume":"55","author":"Zhou","year":"2022","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"10.1016\/j.patcog.2026.113986_b7","first-page":"5879","article-title":"Graph self-supervised learning: A survey","volume":"35","author":"Liu","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.patcog.2026.113986_b8","first-page":"6827","article-title":"What makes for good views for contrastive learning?","volume":"33","author":"Tian","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113986_b9","doi-asserted-by":"crossref","unstructured":"K. He, H. Fan, Y. Wu, S. Xie, R. Girshick, Momentum contrast for unsupervised visual representation learning, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2020, pp. 9729\u20139738.","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"10.1016\/j.patcog.2026.113986_b10","doi-asserted-by":"crossref","unstructured":"Y. Liu, L. Huang, F. Giunchiglia, X. Feng, R. Guan, Improved graph contrastive learning for short text classification, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 38, 2024, pp. 18716\u201318724.","DOI":"10.1609\/aaai.v38i17.29835"},{"key":"10.1016\/j.patcog.2026.113986_b11","series-title":"Towards graph contrastive learning: A survey and beyond","author":"Ju","year":"2024"},{"key":"10.1016\/j.patcog.2026.113986_b12","unstructured":"T. Zhao, W. Jin, Y. Liu, Y. Wang, G. Liu, S. G\u00fcnnemann, N. Shah, M. Jiang, Graph Data Augmentation for Graph Machine Learning: A Survey, Data Eng. 138."},{"issue":"2","key":"10.1016\/j.patcog.2026.113986_b13","doi-asserted-by":"crossref","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. Newsl."},{"key":"10.1016\/j.patcog.2026.113986_b14","doi-asserted-by":"crossref","unstructured":"Y. Liu, Y. Zheng, D. Zhang, H. Chen, H. Peng, S. Pan, Towards unsupervised deep graph structure learning, in: Proceedings of the ACM Web Conference 2022, 2022, pp. 1392\u20131403.","DOI":"10.1145\/3485447.3512186"},{"key":"10.1016\/j.patcog.2026.113986_b15","doi-asserted-by":"crossref","unstructured":"X. Yang, E. Min, K. Liang, Y. Liu, S. Wang, S. Zhou, H. Wu, X. Liu, E. Zhu, Graphlearner: Graph node clustering with fully learnable augmentation, in: Proceedings of the 32nd ACM International Conference on Multimedia, 2024, pp. 5517\u20135526.","DOI":"10.1145\/3664647.3680602"},{"key":"10.1016\/j.patcog.2026.113986_b16","doi-asserted-by":"crossref","unstructured":"X. Gong, C. Yang, C. Shi, Ma-gcl: Model augmentation tricks for graph contrastive learning, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 37, 2023, pp. 4284\u20134292.","DOI":"10.1609\/aaai.v37i4.25547"},{"key":"10.1016\/j.patcog.2026.113986_b17","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113986_b18","doi-asserted-by":"crossref","unstructured":"N. Lee, J. Lee, C. Park, Augmentation-free self-supervised learning on graphs, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36, 2022, pp. 7372\u20137380.","DOI":"10.1609\/aaai.v36i7.20700"},{"key":"10.1016\/j.patcog.2026.113986_b19","article-title":"Deep contrastive graph clustering with information preservation","author":"Lu","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113986_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2025.112951","article-title":"Full-combination contrastive learning for multi-view clustering","volume":"174","author":"Ma","year":"2026","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113986_b21","series-title":"LAC: Graph contrastive learning with learnable augmentation in continuous space","author":"Lin","year":"2024"},{"key":"10.1016\/j.patcog.2026.113986_b22","series-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"1150","article-title":"GCC: Graph contrastive coding for graph neural network pre-training","author":"Qiu","year":"2020"},{"key":"10.1016\/j.patcog.2026.113986_b23","doi-asserted-by":"crossref","unstructured":"Y. Liu, J. Li, Y. Chen, R. Wu, E. Wang, J. Zhou, S. Tian, S. Shen, X. Fu, C. Meng, et al., Revisiting modularity maximization for graph clustering: A contrastive learning perspective, in: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024, pp. 1968\u20131979.","DOI":"10.1145\/3637528.3671967"},{"key":"10.1016\/j.patcog.2026.113986_b24","doi-asserted-by":"crossref","unstructured":"Y. Huang, J. Zhao, D. He, D. Jin, Y. Huang, Z. Wang, Does GCL Need a Large Number of Negative Samples? Enhancing Graph Contrastive Learning with Effective and Efficient Negative Sampling, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 39, 2025, pp. 17511\u201317518.","DOI":"10.1609\/aaai.v39i16.33925"},{"key":"10.1016\/j.patcog.2026.113986_b25","doi-asserted-by":"crossref","unstructured":"J. Wu, X. Chen, S. Li, Uncovering capabilities of model pruning in graph contrastive learning, in: Proceedings of the 32nd ACM International Conference on Multimedia, 2024, pp. 6510\u20136519.","DOI":"10.1145\/3664647.3681449"},{"key":"10.1016\/j.patcog.2026.113986_b26","doi-asserted-by":"crossref","unstructured":"L. Gong, S. Zhou, W. Tu, X. Liu, Attributed Graph Clustering with Dual Redundancy Reduction, in: Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI-22, 2022, pp. 3015\u20133021.","DOI":"10.24963\/ijcai.2022\/418"},{"key":"10.1016\/j.patcog.2026.113986_b27","doi-asserted-by":"crossref","unstructured":"X. Shen, D. Sun, S. Pan, X. Zhou, L.T. Yang, Neighbor contrastive learning on learnable graph augmentation, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 37, 2023, pp. 9782\u20139791.","DOI":"10.1609\/aaai.v37i8.26168"},{"key":"10.1016\/j.patcog.2026.113986_b28","series-title":"Proceedings of the Web Conference 2020","first-page":"1400","article-title":"Structural deep clustering network","author":"Bo","year":"2020"},{"key":"10.1016\/j.patcog.2026.113986_b29","doi-asserted-by":"crossref","unstructured":"G. Cui, J. Zhou, C. Yang, Z. Liu, Adaptive graph encoder for attributed graph embedding, in: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2020, pp. 976\u2013985.","DOI":"10.1145\/3394486.3403140"},{"key":"10.1016\/j.patcog.2026.113986_b30","article-title":"A survey of deep graph clustering: Taxonomy, challenge, application, and open resource","author":"Liu","year":"2026","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.patcog.2026.113986_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2021.108334","article-title":"Graph clustering via variational graph embedding","volume":"122","author":"Guo","year":"2022","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113986_b32","doi-asserted-by":"crossref","unstructured":"H. Zhao, X. Yang, Z. Wang, E. Yang, C. Deng, Graph Debiased Contrastive Learning with Joint Representation Clustering, in: Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI-21, 2021, pp. 3434\u20133440.","DOI":"10.24963\/ijcai.2021\/473"},{"key":"10.1016\/j.patcog.2026.113986_b33","doi-asserted-by":"crossref","unstructured":"Y. Liu, W. Tu, S. Zhou, X. Liu, L. Song, X. Yang, E. Zhu, Deep graph clustering via dual correlation reduction, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36, 2022, pp. 7603\u20137611.","DOI":"10.1609\/aaai.v36i7.20726"},{"key":"10.1016\/j.patcog.2026.113986_b34","doi-asserted-by":"crossref","unstructured":"X. Yang, Y. Liu, S. Zhou, S. Wang, W. Tu, Q. Zheng, X. Liu, L. Fang, E. Zhu, Cluster-guided contrastive graph clustering network, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 37, 2023, pp. 10834\u201310842.","DOI":"10.1609\/aaai.v37i9.26285"},{"key":"10.1016\/j.patcog.2026.113986_b35","doi-asserted-by":"crossref","unstructured":"Y. Liu, X. Yang, S. Zhou, X. Liu, Z. Wang, K. Liang, W. Tu, L. Li, J. Duan, C. Chen, Hard sample aware network for contrastive deep graph clustering, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 37, 2023, pp. 8914\u20138922.","DOI":"10.1609\/aaai.v37i7.26071"},{"key":"10.1016\/j.patcog.2026.113986_b36","doi-asserted-by":"crossref","unstructured":"J. Zhang, H. Peng, L. Sun, G. Wu, C. Liu, Z. Yu, Unsupervised graph clustering with deep structural entropy, in: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V. 2, 2025, pp. 3752\u20133763.","DOI":"10.1145\/3711896.3737173"},{"key":"10.1016\/j.patcog.2026.113986_b37","unstructured":"T.N. Kipf, M. Welling, Semi-Supervised Classification with Graph Convolutional Networks, in: International Conference on Learning Representations, 2017."},{"key":"10.1016\/j.patcog.2026.113986_b38","doi-asserted-by":"crossref","unstructured":"W. Tu, R. Guan, S. Zhou, C. Ma, X. Peng, Z. Cai, Z. Liu, J. Cheng, X. Liu, Attribute-missing graph clustering network, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 38, 2024, pp. 15392\u201315401.","DOI":"10.1609\/aaai.v38i14.29464"},{"issue":"1","key":"10.1016\/j.patcog.2026.113986_b39","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s40747-025-02144-9","article-title":"Importance weighted variational graph autoencoder","volume":"12","author":"Tao","year":"2026","journal-title":"Complex Intell. Syst."},{"issue":"11","key":"10.1016\/j.patcog.2026.113986_b40","article-title":"Visualizing data using t-SNE","volume":"9","author":"Van der Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.patcog.2026.113986_b41","doi-asserted-by":"crossref","unstructured":"X. Yang, C. Tan, Y. Liu, K. Liang, S. Wang, S. Zhou, J. Xia, S.Z. Li, X. Liu, E. Zhu, Convert: Contrastive graph clustering with reliable augmentation, in: Proceedings of the 31st ACM International Conference on Multimedia, 2023, pp. 319\u2013327.","DOI":"10.1145\/3581783.3611809"},{"issue":"10","key":"10.1016\/j.patcog.2026.113986_b42","doi-asserted-by":"crossref","first-page":"13789","DOI":"10.1109\/TNNLS.2023.3271871","article-title":"Simple contrastive graph clustering","volume":"35","author":"Liu","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.patcog.2026.113986_b43","doi-asserted-by":"crossref","unstructured":"X. Wu, Q. Cheng, Stabilizing and enhancing link prediction through deepened graph auto-encoders, in: Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI-22, Vol. 2022, 2022, p. 3587.","DOI":"10.24963\/ijcai.2022\/498"},{"key":"10.1016\/j.patcog.2026.113986_b44","doi-asserted-by":"crossref","unstructured":"Q. Tan, X. Zhang, N. Liu, D. Zha, L. Li, R. Chen, S.-H. Choi, X. Hu, Bring your own view: Graph neural networks for link prediction with personalized subgraph selection, in: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023, pp. 625\u2013633.","DOI":"10.1145\/3539597.3570407"},{"key":"10.1016\/j.patcog.2026.113986_b45","doi-asserted-by":"crossref","unstructured":"J. Kim, K.H. Park, H. Yoon, U. Kang, Accurate Link Prediction for Edge-Incomplete Graphs via PU Learning, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 39, 2025, pp. 17877\u201317885.","DOI":"10.1609\/aaai.v39i17.33966"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326009519?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326009519?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T14:50:19Z","timestamp":1780930219000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320326009519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":45,"alternative-id":["S0031320326009519"],"URL":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113986","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Convolution-aware multi-view graph contrastive learning","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113986","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"113986"}}