{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T17:01:53Z","timestamp":1786122113712,"version":"build-2736575974"},"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"}],"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.114177","type":"journal-article","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T15:24:14Z","timestamp":1780759454000},"page":"114177","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PB","title":["Predict overlooked nodes: A fast graph representation learning paradigm"],"prefix":"10.1016","volume":"180","author":[{"given":"Siqi","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanchen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4274-7332","authenticated-orcid":false,"given":"Hongyuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuelong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2026.114177_b1","unstructured":"T.N. Kipf, M. Welling, Semi-Supervised Classification with Graph Convolutional Networks, in: 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings, 2017."},{"key":"10.1016\/j.patcog.2026.114177_b2","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016","journal-title":"NIPS Work. Bayesian Deep. Learn."},{"key":"10.1016\/j.patcog.2026.114177_b3","series-title":"International Conference on Learning Representations","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2019"},{"key":"10.1016\/j.patcog.2026.114177_b4","series-title":"Momentum contrast for unsupervised visual representation learning","first-page":"9729","author":"He","year":"2020"},{"key":"10.1016\/j.patcog.2026.114177_b5","series-title":"International Conference on Machine Learning","first-page":"1597","article-title":"A simple framework for contrastive learning of visual representations","author":"Chen","year":"2020"},{"key":"10.1016\/j.patcog.2026.114177_b6","series-title":"Empirical Methods in Natural Language Processing","article-title":"SimCSE: Simple contrastive learning of sentence embeddings","author":"Gao","year":"2021"},{"key":"10.1016\/j.patcog.2026.114177_b7","series-title":"A contrastive framework for self-supervised sentence representation transfer","author":"Yan","year":"2021"},{"key":"10.1016\/j.patcog.2026.114177_b8","series-title":"NeurIPS\u201920","article-title":"Graph random neural network for semi-supervised learning on graphs","author":"Feng","year":"2020"},{"key":"10.1016\/j.patcog.2026.114177_b9","series-title":"Training robust graph neural networks with topology adaptive edge dropping","author":"Gao","year":"2021"},{"key":"10.1016\/j.patcog.2026.114177_b10","series-title":"DropEdge: Towards deep graph convolutional networks on node classification","author":"Rong","year":"2020"},{"key":"10.1016\/j.patcog.2026.114177_b11","doi-asserted-by":"crossref","unstructured":"Z. Peng, W. Huang, M. Luo, Q. Zheng, Y. Rong, T. Xu, J. Huang, Graph representation learning via graphical mutual information maximization, in: Proceedings of the Web Conference 2020, 2020, pp. 259\u2013270.","DOI":"10.1145\/3366423.3380112"},{"key":"10.1016\/j.patcog.2026.114177_b12","series-title":"International Conference on Machine Learning","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","author":"Hassani","year":"2020"},{"key":"10.1016\/j.patcog.2026.114177_b13","first-page":"21824","article-title":"Why does dropping edges usually outperform adding edges in graph contrastive learning?","volume":"vol. 39","author":"Xu","year":"2025"},{"key":"10.1016\/j.patcog.2026.114177_b14","unstructured":"S. Huang, Y. Xu, H. Zhang, X. Li, Learn beneficial noise as graph augmentation, in: Forty-Second International Conference on Machine Learning, 2025."},{"key":"10.1016\/j.patcog.2026.114177_b15","article-title":"Variational positive-incentive noise: How noise benefits models","author":"Zhang","year":"2025","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.114177_b16","series-title":"Data augmentation of contrastive learning is estimating positive-incentive noise","author":"Zhang","year":"2024"},{"key":"10.1016\/j.patcog.2026.114177_b17","first-page":"17449","article-title":"Enhance vision-language alignment with noise","volume":"vol. 39","author":"Huang","year":"2025"},{"key":"10.1016\/j.patcog.2026.114177_b18","article-title":"Xlnet: Generalized autoregressive pretraining for language understanding","volume":"32","author":"Yang","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.114177_b19","first-page":"1877","article-title":"Language models are few-shot learners","volume":"33","author":"Brown","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.114177_b20","series-title":"Glm: General language model pretraining with autoregressive blank infilling","author":"Du","year":"2021"},{"key":"10.1016\/j.patcog.2026.114177_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2025.111463","article-title":"MDFCL: Multimodal data fusion-based graph contrastive learning framework for molecular property prediction","volume":"163","author":"Gong","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.114177_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2025.111873","article-title":"Efficiently harmonizing information sharing for heterogeneous graph contrastive learning","volume":"169","author":"Zhu","year":"2026","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.114177_b23","article-title":"Dual-level noise augmentation for graph clustering with triplet-wise contrastive learning","author":"Zhao","year":"2025","journal-title":"Pattern Recognit."},{"issue":"10","key":"10.1016\/j.patcog.2026.114177_b24","doi-asserted-by":"crossref","first-page":"18281","DOI":"10.1109\/JIOT.2024.3361899","article-title":"Open-set radar emitter recognition via deep metric autoencoder","volume":"11","author":"Yang","year":"2024","journal-title":"IEEE Internet Things J."},{"issue":"5","key":"10.1016\/j.patcog.2026.114177_b25","doi-asserted-by":"crossref","first-page":"8853","DOI":"10.1109\/TNNLS.2024.3414942","article-title":"Open-ICL: Open-set modulation classification via incremental contrastive learning","volume":"36","author":"Yang","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.patcog.2026.114177_b26","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.inffus.2019.09.005","article-title":"Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding","volume":"55","author":"Hu","year":"2020","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.patcog.2026.114177_b27","doi-asserted-by":"crossref","unstructured":"Q. Xu, Z. Hu, Y. Duan, E. Pei, Y. Tai, A Hidden Stumbling Block in Generalized Category Discovery: Distracted Attention, in: Proceedings of the IEEE\/CVF International Conference on Computer Vision, 2025.","DOI":"10.1109\/ICCV51701.2025.00045"},{"issue":"11","key":"10.1016\/j.patcog.2026.114177_b28","doi-asserted-by":"crossref","first-page":"4570","DOI":"10.1109\/TCSI.2023.3295940","article-title":"Controller synthesis of aperiodic sampled-data networked control system with application to interleaved flyback module integrated converter","volume":"70","author":"Chen","year":"2023","journal-title":"IEEE Trans. Circuits Syst. I. Regul. Pap."},{"issue":"3","key":"10.1016\/j.patcog.2026.114177_b29","first-page":"93","article-title":"Collective classification in network data","volume":"29","author":"Sen","year":"2008","journal-title":"AI Mag."},{"key":"10.1016\/j.patcog.2026.114177_b30","series-title":"Wiki-cs: A wikipedia-based benchmark for graph neural networks","author":"Mernyei","year":"2020"},{"key":"10.1016\/j.patcog.2026.114177_b31","series-title":"Pitfalls of graph neural network evaluation","author":"Shchur","year":"2018"},{"key":"10.1016\/j.patcog.2026.114177_b32","unstructured":"H. Pei, B. Wei, K.C.-C. Chang, Y. Lei, B. Yang, GEOM-GCN: Geometric Graph Convolutional Networks, in: International Conference on Learning Representations, ICLR, 2020."},{"issue":"2","key":"10.1016\/j.patcog.2026.114177_b33","doi-asserted-by":"crossref","first-page":"cnab014","DOI":"10.1093\/comnet\/cnab014","article-title":"Multi-scale attributed node embedding","volume":"9","author":"Rozemberczki","year":"2021","journal-title":"J. Complex Networks"},{"key":"10.1016\/j.patcog.2026.114177_b34","series-title":"International Conference on Learning Representations","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"10.1016\/j.patcog.2026.114177_b35","series-title":"International Conference on Learning Representations","article-title":"Deep graph infomax","author":"Veli\u010dkovi\u0107","year":"2019"},{"key":"10.1016\/j.patcog.2026.114177_b36","series-title":"ICML Workshop on Graph Representation Learning and beyond","article-title":"Deep Graph Contrastive Representation Learning","author":"Zhu","year":"2020"},{"key":"10.1016\/j.patcog.2026.114177_b37","doi-asserted-by":"crossref","unstructured":"Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, L. Wang, Graph contrastive learning with adaptive augmentation, in: Proceedings of the Web Conference 2021, 2021, pp. 2069\u20132080.","DOI":"10.1145\/3442381.3449802"},{"key":"10.1016\/j.patcog.2026.114177_b38","series-title":"International Conference on Learning Representations","article-title":"Large-scale representation learning on graphs via bootstrapping","author":"Thakoor","year":"2022"},{"key":"10.1016\/j.patcog.2026.114177_b39","first-page":"8544","article-title":"Regcl: Rethinking message passing in graph contrastive learning","volume":"vol. 38","author":"Ji","year":"2024"},{"key":"10.1016\/j.patcog.2026.114177_b40","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v36i7.20700","article-title":"Augmentation-free self-supervised learning on graphs","author":"Lee","year":"2022","journal-title":"AAAI"},{"key":"10.1016\/j.patcog.2026.114177_b41","doi-asserted-by":"crossref","unstructured":"T. Xiao, H. Zhu, Z. Chen, S. Wang, Simple and Asymmetric Graph Contrastive Learning without Augmentations, in: Thirty-Seventh Conference on Neural Information Processing Systems (NeurIPS), 2023.","DOI":"10.52202\/075280-0710"},{"key":"10.1016\/j.patcog.2026.114177_b42","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.114177_b43","series-title":"Forty-Second International Conference on Machine Learning","article-title":"ML2-GCL: Manifold learning inspired lightweight graph contrastive learning","author":"Liang","year":"2025"},{"key":"10.1016\/j.patcog.2026.114177_b44","doi-asserted-by":"crossref","unstructured":"C. Ji, C. He, Q. Li, Q. Sun, X. Fu, J. Li, OS-GCL: A One-Shot Learner in Graph Contrastive Learning, in: Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025, pp. 2964\u20132972.","DOI":"10.24963\/ijcai.2025\/330"},{"key":"10.1016\/j.patcog.2026.114177_b45","doi-asserted-by":"crossref","unstructured":"L. Yang, Y. Cai, H. Ning, J. Zhuo, D. Jin, Z. Ma, Y. Guo, C. Wang, Z. Wang, Universal graph self-contrastive learning, in: Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025, pp. 3534\u20133542.","DOI":"10.24963\/ijcai.2025\/393"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326011428?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326011428?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T08:08:18Z","timestamp":1786090098000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320326011428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":45,"alternative-id":["S0031320326011428"],"URL":"https:\/\/doi.org\/10.1016\/j.patcog.2026.114177","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":"Predict overlooked nodes: A fast graph representation learning paradigm","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patcog.2026.114177","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":"114177"}}