{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T01:54:09Z","timestamp":1793066049210,"version":"4.5.0"},"reference-count":51,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":["Neural Networks"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.neunet.2025.108045","type":"journal-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T23:19:16Z","timestamp":1756509556000},"page":"108045","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["FA-GCL: Feature-augmented graph contrastive learning method"],"prefix":"10.1016","volume":"193","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2751-0616","authenticated-orcid":false,"given":"Long","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Honghui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.neunet.2025.108045_bib0001","article-title":"A graph neural approach for group recommendation system based on pairwise preferences","volume":"107","author":"Abolghasemi","year":"2024","journal-title":"An International Journal on Information Fusion"},{"key":"10.1016\/j.neunet.2025.108045_bib0002","series-title":"NeurIPS 2019","first-page":"15509","article-title":"Learning representations by maximizing mutual information across views","author":"Bachman","year":"2019"},{"key":"10.1016\/j.neunet.2025.108045_bib0003","unstructured":"Bojchevski, A., & G\u00fcnnemann, S. (2017). Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking. arXiv preprint arXiv: 1707.03815."},{"key":"10.1016\/j.neunet.2025.108045_bib0004","series-title":"Ismb 2005","first-page":"47","article-title":"Protein function prediction via graph kernels","author":"Borgwardt","year":"2005"},{"key":"10.1016\/j.neunet.2025.108045_bib0005","series-title":"WSDM 2023","first-page":"544","article-title":"Heterogeneous graph contrastive learning for recommendation","author":"Chen","year":"2023"},{"key":"10.1016\/j.neunet.2025.108045_bib0006","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1021\/jm00106a046","article-title":"Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity","volume":"342","author":"Debnath","year":"1991","journal-title":"Journal of Medicinal Chemistry"},{"key":"10.1016\/j.neunet.2025.108045_bib0007","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.neucom.2018.06.067","article-title":"Structured sparse graphs using manifold constraints for visual data analysis","volume":"315","author":"Dornaika","year":"2018","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neunet.2025.108045_bib0008","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.neunet.2023.08.039","article-title":"Self-supervised contrastive graph representation with node and graph augmentation","volume":"167","author":"Duan","year":"2023","journal-title":"Neural Networks"},{"key":"10.1016\/j.neunet.2025.108045_bib0009","series-title":"Kdd","first-page":"364","article-title":"Spatial-temporal graph ODE networks for traffic flow forecasting","author":"Fang","year":"2021"},{"issue":"Part B","key":"10.1016\/j.neunet.2025.108045_bib0010","article-title":"Contrastive graph learning long and short-term interests for POI recommendation","volume":"238","author":"Fu","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.neunet.2025.108045_bib0011","series-title":"Icml","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume":"vol. 70","author":"Gilmer","year":"2017"},{"key":"10.1016\/j.neunet.2025.108045_bib0012","series-title":"SIGKDD 2016","first-page":"855","article-title":"node2vec: Scalable feature learning for networks","author":"Grover","year":"2016"},{"key":"10.1016\/j.neunet.2025.108045_bib0013","article-title":"GraphCL: Contrastive self-supervised learning of graph representations","author":"Hafidi","year":"2020","journal-title":"CoRR"},{"key":"10.1016\/j.neunet.2025.108045_bib0014","series-title":"NeurIPS 2017","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"Hamilton","year":"2017"},{"key":"10.1016\/j.neunet.2025.108045_bib0015","series-title":"ICML 2020","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume":"vol. 119","author":"Hassani","year":"2020"},{"key":"10.1016\/j.neunet.2025.108045_bib0016","series-title":"CVPR 2020","first-page":"9726","article-title":"Momentum contrast for unsupervised visual representation learning","author":"He","year":"2020"},{"key":"10.1016\/j.neunet.2025.108045_bib0017","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.ins.2022.11.139","article-title":"K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data","volume":"622","author":"Ikotun","year":"2023","journal-title":"Information Sciences"},{"key":"10.1016\/j.neunet.2025.108045_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112059","article-title":"Inter-structure and intra-semantics graph contrastive learning for disease prediction","volume":"300","author":"Kang","year":"2024","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.neunet.2025.108045_bib0019","series-title":"ICLR 2015","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2015"},{"key":"10.1016\/j.neunet.2025.108045_bib0020","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016","journal-title":"CoRR"},{"key":"10.1016\/j.neunet.2025.108045_bib0021","series-title":"ICLR 2017","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017"},{"key":"10.1016\/j.neunet.2025.108045_bib0022","series-title":"CVPR 2022","first-page":"60","article-title":"Robust optimization as data augmentation for large-scale graphs","author":"Kong","year":"2022"},{"issue":"6","key":"10.1016\/j.neunet.2025.108045_bib0023","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/3065386","article-title":"Imagenet classification with deep convolutional neural networks","volume":"60","author":"Krizhevsky","year":"2017","journal-title":"Communications of the ACM"},{"key":"10.1016\/j.neunet.2025.108045_bib0024","series-title":"WWW 2023","first-page":"143","article-title":"Seegera: Self-supervised semi-implicit graph variational auto-encoders with masking","author":"Li","year":"2023"},{"key":"10.1016\/j.neunet.2025.108045_bib0025","article-title":"Wiki-CS: A wikipedia-based benchmark for graph neural networks","author":"Mernyei","year":"2020","journal-title":"CoRR"},{"issue":"4","key":"10.1016\/j.neunet.2025.108045_bib0026","first-page":"67:1","article-title":"Graph co-attentive session-based recommendation","volume":"40","author":"Pan","year":"2022","journal-title":"Trans. Inf. Syst."},{"key":"10.1016\/j.neunet.2025.108045_bib0027","first-page":"1","article-title":"Distance-aware learning for inductive link prediction on temporal networks","author":"Pan","year":"2023","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"10.1016\/j.neunet.2025.108045_bib0028","series-title":"KDD 20","first-page":"1150","article-title":"GCC: Graph contrastive coding for graph neural network pre-training","author":"Qiu","year":"2020"},{"key":"10.1016\/j.neunet.2025.108045_bib0029","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur","year":"2018","journal-title":"CoRR"},{"key":"10.1016\/j.neunet.2025.108045_bib0030","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"Journal of Machine Learning Research: JMLR"},{"key":"10.1016\/j.neunet.2025.108045_bib0031","series-title":"ICLR 2020","article-title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","author":"Sun","year":"2020"},{"key":"10.1016\/j.neunet.2025.108045_bib0032","doi-asserted-by":"crossref","DOI":"10.1016\/j.neunet.2024.106645","article-title":"GTC: Gnn-transformer co-contrastive learning for self-supervised heterogeneous graph representation","volume":"181","author":"Sun","year":"2025","journal-title":"Neural Networks"},{"issue":"1","key":"10.1016\/j.neunet.2025.108045_bib0033","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TCBB.2022.3140388","article-title":"Topology driven analysis of protein - protein interactome for prioritizing key comorbid genes via sub graph based average path length centrality","volume":"20","author":"Suresh","year":"2023","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"10.1016\/j.neunet.2025.108045_bib0034","series-title":"ICML 2021","first-page":"10096","article-title":"Efficientnetv2: Smaller models and faster training","volume":"vol. 139","author":"Tan","year":"2021"},{"key":"10.1016\/j.neunet.2025.108045_bib0035","article-title":"Bootstrapped representation learning on graphs","author":"Thakoor","year":"2021","journal-title":"CoRR"},{"key":"10.1016\/j.neunet.2025.108045_bib0036","article-title":"Graph attention networks","author":"Velickovic","year":"2017","journal-title":"CoRR"},{"key":"10.1016\/j.neunet.2025.108045_bib0037","series-title":"ICLR 2019","article-title":"Deep graph infomax","author":"Velickovic","year":"2019"},{"issue":"3","key":"10.1016\/j.neunet.2025.108045_bib0038","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","article-title":"Comparison of descriptor spaces for chemical compound retrieval and classification","volume":"14","author":"Wale","year":"2008","journal-title":"Knowledge and Information Systems"},{"key":"10.1016\/j.neunet.2025.108045_bib0039","series-title":"NeurIPS 2019","first-page":"12614","article-title":"Implicit semantic data augmentation for deep networks","author":"Wang","year":"2019"},{"key":"10.1016\/j.neunet.2025.108045_bib0040","first-page":"1","article-title":"Select your own counterparts: Self-supervised graph contrastive learning with positive sampling","author":"Wang","year":"2024","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"8","key":"10.1016\/j.neunet.2025.108045_bib0041","first-page":"7909","article-title":"Effective clustering via structured graph learning","volume":"35","author":"Wu","year":"2023","journal-title":"Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neunet.2025.108045_bib0042","series-title":"WWW 2022","first-page":"1070","article-title":"SimGRACE: A simple framework for graph contrastive learning without data augmentation","author":"Xia","year":"2022"},{"key":"10.1016\/j.neunet.2025.108045_bib0043","series-title":"ICML 2022","first-page":"24460","article-title":"Self-supervised representation learning via latent graph prediction","volume":"vol. 162","author":"Xie","year":"2022"},{"key":"10.1016\/j.neunet.2025.108045_bib0044","doi-asserted-by":"crossref","first-page":"82400","DOI":"10.1109\/ACCESS.2023.3301561","article-title":"Mixup feature: A pretext task self-supervised learning method for enhanced visual feature learning","volume":"11","author":"Xu","year":"2023","journal-title":"Access"},{"key":"10.1016\/j.neunet.2025.108045_bib0045","series-title":"ICLR 2019","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2019"},{"key":"10.1016\/j.neunet.2025.108045_bib0046","series-title":"SIGKDD 2015","first-page":"1365","article-title":"Deep graph kernels","author":"Yanardag","year":"2015"},{"key":"10.1016\/j.neunet.2025.108045_bib0047","series-title":"ICML 2016","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","volume":"vol. 48","author":"Yang","year":"2016"},{"key":"10.1016\/j.neunet.2025.108045_bib0048","series-title":"NeurIPS 2020","article-title":"Graph contrastive learning with augmentations","author":"You","year":"2020"},{"key":"10.1016\/j.neunet.2025.108045_bib0049","series-title":"NeurIPS 2021","first-page":"76","article-title":"From canonical correlation analysis to self-supervised graph neural networks","author":"Zhang","year":"2021"},{"key":"10.1016\/j.neunet.2025.108045_bib0050","article-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020","journal-title":"CoRR"},{"key":"10.1016\/j.neunet.2025.108045_bib0051","series-title":"IJCAI 2019","first-page":"6246","article-title":"Adversarial attacks on neural networks for graph data","author":"Z\u00fcgner","year":"2019"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608025009256?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608025009256?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T16:08:33Z","timestamp":1768061313000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893608025009256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":51,"alternative-id":["S0893608025009256"],"URL":"https:\/\/doi.org\/10.1016\/j.neunet.2025.108045","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"FA-GCL: Feature-augmented graph contrastive learning method","name":"articletitle","label":"Article Title"},{"value":"Neural Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neunet.2025.108045","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108045"}}