Skip to main content
Springer Nature Link
Log in

NPGCL: neighbor enhancement and embedding perturbation with graph contrastive learning for recommendation

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Graph Neural Networks (GNNs) have significantly advanced recommendation systems by modeling user-item interactions through bipartite graphs. However, real-world user-item interaction data are often sparse and noisy. Traditional bipartite graph modeling fails to capture higher-order relationships between users and items, limiting the ability of GNNs to learn high-quality node embeddings. While existing graph contrastive learning methods address data sparsity by partitioning nodes into positive and negative pairs, they also neglect these higher-order relationships, thus limiting the effectiveness of contrastive learning in recommendation systems. Furthermore, due to the inherent limitations of graph convolution, noise can propagate and amplify with increasing layers in deep graph convolutional networks. To address these challenges, Neighbor Enhancement and Embedding Perturbation for Graph Contrastive Learning (NPGCL) is proposed, which introduces two key modules - Relational Neighbor Enhancement Module and Collaborative Neighbor Enhancement Module - to capture higher-order relationships between homogeneous nodes and calculate interaction importance for noise suppression. Moreover, NPGCL employs an Embedding Perturbation Strategy and applies inter-layer contrastive learning to mitigate the noise impact caused by multi-layer graph convolutions. Experimental results demonstrate that NPGCL significantly improves performance across four publicly available datasets, with a notable enhancement in robustness, especially in noisy environments. Specifically, NPGCL achieves performance improvements of 1.77%-3.34% and 3.87%-9.07% on the Gowalla and Amazon-books datasets, respectively. In noisy datasets, NPGCL improves Recall@20 by 4.98% and 10.92%, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data Availability

The authors will supply the relevant data in response to reasonable requests.

References

  1. Schafer JB, Frankowski D, Herlocker JL et al (2007) Collaborative filtering recommender systems. In: The Adaptive Web

  2. Sarwar B, Karypis G, Konstan J et al (2001) Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th international conference on world wide web. Association for computing machinery, New York, NY, USA, WWW ’01, p 285–295

  3. Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International conference on learning representations

  4. Veličković P, Cucurull G, Casanova A et al (2018) Graph attention networks. In: International conference on learning representations

  5. Wu X, Wang H, Gong Y et al (2023) Graph neural networks for molecular and materials representation. J Mater Inf 3(2). https://doi.org/10.20517/jmi.2023.10

  6. He X, Deng K, Wang X et al (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. Association for Computing Machinery, New York, NY, USA, SIGIR ’20, p 639–648

  7. Wang X, He X, Wang M et al (2019) Neural graph collaborative filtering. In: Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval. Association for computing machinery, New York, NY, USA, SIGIR’19, p 165–174

  8. Kong T, Kim T, Jeon J et al (2022) Linear, or non-linear, that is the question! In: Proceedings of the 15th ACM international conference on web search and data mining. Association for computing machinery, New York, NY, USA, WSDM ’22, p 517–525

  9. Jaiswal A, Babu AR, Zadeh MZ et al (2021) A survey on contrastive self-supervised learning. Technol 9(1)

  10. Khosla P, Teterwak P, Wang C et al (2020) Supervised contrastive learning. In: Proceedings of the 34th international conference on neural information processing systems. Curran associates Inc., Red Hook, NY, USA, NIPS ’20

  11. Liu X, Zhang F, Hou Z et al (2023) Self-supervised learning: Generative or contrastive. IEEE Trans Knowl Data Eng 35(1):857–876

    MATH  Google Scholar 

  12. Lin D, Ding X, Hu D et al (2023) Community-aware graph contrastive learning for collaborative filtering. Appl Intell 53(21):25836–25849. https://doi.org/10.1007/s10489-023-04787-y

    Article  MATH  Google Scholar 

  13. Wu J, Wang X, Feng F et al (2021) Self-supervised graph learning for recommendation. In: Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval. Association for computing machinery, New York, NY, USA, SIGIR ’21, p 726–735

  14. Yao T, Yi X, Cheng D et al (2021) Self-supervised learning for large-scale item recommendations. pp 4321–4330

  15. Yu J, Yin H, Xia X et al (2022) Are graph augmentations necessary? simple graph contrastive learning for recommendation. In: Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. Association for computing machinery, New York, NY, USA, SIGIR ’22, p 1294–1303

  16. Yu J, Xia X, Chen T et al (2023) Xsimgcl: Towards extremely simple graph contrastive learning for recommendation. IEEE Trans on Knowl and Data Eng 36(2):913–926

    MATH  Google Scholar 

  17. Sun J, Zhang Y, Ma C et al (2019) Multi-graph convolution collaborative filtering. In: 2019 IEEE International Conference on Data Mining (ICDM), pp 1306–1311

  18. Liao J, Zhou W, Luo F et al (2022) Sociallgn: Light graph convolution network for social recommendation. Inf Sci 589(C):595–607

  19. Fan Z, Xu K, Dong Z et al (2023) Graph collaborative signals denoising and augmentation for recommendation. In: Proceedings of the 46th International ACM SIGIR conference on research and development in information retrieval. Association for computing machinery, New York, NY, USA, SIGIR ’23, p 2037–2041

  20. Singh PK, Pramanik PKD, Choudhury P (2022) Mitigating sparsity using bhattacharyya coefficient and items’ categorical attributes: improving the performance of collaborative filtering based recommendation systems. Appl Intell 52(5):5513–5536. https://doi.org/10.1007/s10489-021-02462-8

    Article  MATH  Google Scholar 

  21. Zhao J, Huang K, Li P (2023) Dual channel group-aware graph convolutional networks for collaborative filtering. Appl Intell 53(21):25511–25524. https://doi.org/10.1007/s10489-023-04860-6

    Article  Google Scholar 

  22. Jian M, Guo J, Shi G et al (2023) Multimodal collaborative graph for image recommendation. Appl Intell 53(1):560–573. https://doi.org/10.1007/s10489-022-03304-x

    Article  MATH  Google Scholar 

  23. Aldhubri A, Lasheng Y, Mohsen F et al (2021) Variational autoencoder bayesian matrix factorization (vabmf) for collaborative filtering. Appl Intell 51(7):5132–5145. https://doi.org/10.1007/s10489-020-02049-9

    Article  MATH  Google Scholar 

  24. Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Comput 42(8):30–37

    MATH  Google Scholar 

  25. Rendle S, Freudenthaler C, Gantner Z et al (2009) Bpr: Bayesian personalized ranking from implicit feedback. In: Proceedings of the 25th conference on uncertainty in artificial intelligence. AUAI Press, Arlington, Virginia, USA, UAI ’09, p 452–461

  26. He X, Liao L, Zhang H et al (2017) Neural collaborative filtering. In: Proceedings of the 26th international conference on world wide web. International world wide web conferences steering committee, Republic and Canton of Geneva, CHE, WWW ’17, p 173–182

  27. Kabbur S, Ning X, Karypis G (2013) Fism: factored item similarity models for top-n recommender systems. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining. Association for computing machinery, New York, NY, USA, KDD ’13, p 659–667

  28. Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining. Association for computing machinery, New York, NY, USA, KDD ’08, p 426–434

  29. Chen J, Zhang H, He X et al (2017) Attentive collaborative filtering: Multimedia recommendation with item- and component-level attention. In: Proceedings of the 40th International ACM SIGIR conference on research and development in information retrieval. Association for computing machinery, New York, NY, USA, SIGIR ’17, p 335–344

  30. He X, He Z, Song J et al (2018) Nais: Neural attentive item similarity model for recommendation. IEEE Trans Knowl Data Eng 30(12):2354–2366

    Article  MATH  Google Scholar 

  31. Surono S, Rivaldi M, Arrova Dewi D et al (2023) New approach to image segmentation: U-net convolutional network for multiresolution ct image lung segmentation. Emerging Sci J 7:498–506

    Article  MATH  Google Scholar 

  32. Surono S, Firza Afitian MY, Setyawan A et al (2023) Comparison of cnn classification model using machine learning with bayesian optimizer. HighTech Innov J 4:531–542

    Article  Google Scholar 

  33. Haque A, Pulok RA, Rahman M et al (2023) Recognition of bangladeshi sign language (bdsl) words using deep convolutional neural networks (dcnns). Emerging Sci J7:2183–2201

    Article  Google Scholar 

  34. Chen L, Wu L, Hong R et al (2020) Revisiting graph based collaborative filtering: A linear residual graph convolutional network approach. Proc AAAI Conf Artif Intell 34(01):27–34. https://doi.org/10.1609/aaai.v34i01.5330

    Article  MATH  Google Scholar 

  35. Ying R, He R, Chen K et al (2018) Graph convolutional neural networks for web-scale recommender systems. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. Association for computing machinery, New York, NY, USA, KDD ’18, p 974–983

  36. Wang X, Jin H, Zhang A et al (2020) Disentangled graph collaborative filtering. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval. Association for computing machinery, New York, NY, USA, SIGIR ’20, p 1001–1010

  37. Guo J, Du L, Chen X et al (2023) On manipulating signals of user-item graph: A jacobi polynomial-based graph collaborative filtering. In: Proceedings of the 29th ACM SIGKDD conference on knowledge discovery and data mining. Association for computing machinery, New York, NY, USA, KDD ’23, p 602–613

  38. Wu X, Li Y, Wang J et al (2022) Ubar: User behavior-aware recommendation with knowledge graph. Knowl-Based Syst 254:109661. https://doi.org/10.1016/j.knosys.2022.109661

    Article  MATH  Google Scholar 

  39. Wu X, Li J, Wang J et al (2023) Multimodal contrastive learning for radiology report generation. J Ambient Intell Human Comput 14(8):11185–11194. https://doi.org/10.1007/s12652-022-04398-4

    Article  MATH  Google Scholar 

  40. Wu X, Ji S, Wang J et al (2022) Speech synthesis with face embeddings. Appl Intell 52(13):14839–14852. https://doi.org/10.1007/s10489-022-03227-7

    Article  MATH  Google Scholar 

  41. Lin Z, Tian C, Hou Y et al (2022) Improving graph collaborative filtering with neighborhood-enriched contrastive learning. In: Proceedings of the ACM Web conference 2022. Association for Computing Machinery, New York, NY, USA, WWW ’22, p 2320–2329

  42. Wu Y, Zhang L, Mo F et al (2024) Unifying graph convolution and contrastive learning in collaborative filtering. In: Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining. Association for computing machinery, New York, NY, USA, KDD ’24, p 3425–3436

  43. Hamers L, Hemeryck Y, Herweyers G et al (1989) Similarity measures in scientometric research: The jaccard index versus salton’s cosine formula. Inf Process Manag 25(3):315–318

    Article  Google Scholar 

  44. Wang H, Chen B, Li WJ (2013) Collaborative topic regression with social regularization for tag recommendation. In: Proceedings of the 23rd international joint conference on artificial intelligence. AAAI Press, IJCAI ’13, p 2719–2725

  45. Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. Association for computing machinery, New York, NY, USA, KDD ’11, p 1082–1090

  46. Zhang Y, Pang L, Shi L et al (2014) Large scale purchase prediction with historical user actions on b2c online retail platform. CoRR abs/1408.6515. arXiv:1408.6515

  47. McAuley J, Targett C, Shi Q et al (2015) Image-based recommendations on styles and substitutes. In: Proceedings of the 38th International ACM SIGIR conference on research and development in information retrieval. Association for computing machinery, New York, NY, USA, SIGIR ’15, p 43–52

  48. Zhao WX, Chen J, Wang P et al (2020) Revisiting alternative experimental settings for evaluating top-n item recommendation algorithms. In: Proceedings of the 29th ACM international conference on information & knowledge management. Association for computing machinery, New York, NY, USA, CIKM ’20, p 2329–2332

  49. Zhao WX, Mu S, Hou Y et al (2021) Recbole: Towards a unified, comprehensive and efficient framework for recommendation algorithms. In: Proceedings of the 30th ACM international conference on information & knowledge management. Association for computing machinery, New York, NY, USA, CIKM ’21, p 4653–4664

  50. Wang T, Isola P (2020) Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In: Proceedings of the 37th international conference on machine learning. JMLR.org, ICML’20

Download references

Acknowledgements

This work is supported by the National Key Research and Development Program of China (2022YFB3707800), the National Natural Science Foundation of China (No. 62172267), the State Key Program of National Natural Science Foundation of China (Grant No. 61936001), the Project of Key Laboratory of Silicate Cultural Relics Conservation (Shanghai University), Ministry of Education (No. SCRC2023ZZ02ZD).

Author information

Authors and Affiliations

  1. School of Computer Engineering and Science, Shanghai University, Shanghai, 200444, China

    Xing Wu, Haodong Wang & Quan Qian

  2. Shanghai Institute for Advanced Communication and Data Science, Shanghai University, Shanghai, 200444, China

    Xing Wu & Quan Qian

  3. Key Laboratory of Silicate Cultural Relics Conservation (Shanghai University), Ministry of Education, Shanghai, 200444, China

    Xing Wu & Quan Qian

  4. CSSC Seago System Technology Co., Ltd, Shanghai, 200444, China

    Junfeng Yao

  5. Department of Geography, Hong Kong Baptist University, Hong Kong, 999077, China

    Jun Song

Authors
  1. Xing Wu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Haodong Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Junfeng Yao
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Quan Qian
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Jun Song
    View author publications

    You can also search for this author inPubMed Google Scholar

Contributions

Not applicable.

Corresponding author

Correspondence to Xing Wu.

Ethics declarations

Competing interests

The authors declare that there is no conflict of interests with anybody or any institution regarding the publication of this manuscript.

Ethics approval and consent to participate

All authors give consent to participate.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, X., Wang, H., Yao, J. et al. NPGCL: neighbor enhancement and embedding perturbation with graph contrastive learning for recommendation. Appl Intell 55, 407 (2025). https://doi.org/10.1007/s10489-025-06301-y

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10489-025-06301-y

Keywords