Skip to main content
Log in

Improving graph-based recommendation with unraveled graph learning

  • Published:
Data Mining and Knowledge Discovery Aims and scope Submit manuscript

Abstract

Graph Collaborative Filtering (GraphCF) has emerged as a promising approach in recommendation systems, leveraging the inferential power of Graph Neural Networks. Furthermore, the integration of contrastive learning has enhanced the performance of GraphCF methods. Recent research has shifted from graph augmentation to noise perturbation in contrastive learning, leading to significant performance improvements. However, we contend that the primary factor in performance enhancement is not graph augmentation or noise perturbation, but rather the balance of the embedding from each layer in the output embedding. To substantiate our claim, we conducted preliminary experiments with multiple state-of-the-art GraphCF methods. Based on our observations and insights, we propose a novel approach named Unraveled Graph Contrastive Learning (UGCL), which includes a new propagation scheme to further enhance performance. To the best of our knowledge, this is the first approach that specifically addresses the balance factor in the output embedding for performance improvement. We have carried out extensive experiments on multiple large-scale benchmark datasets to evaluate the effectiveness of our proposed approach. The results indicate that UGCL significantly outperforms all other state-of-the-art baseline models, also showing superior performance in terms of fairness and debiasing capabilities compared to other baselines.

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

Access this article

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Explore related subjects

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

Data availability

No datasets were generated or analysed during the current study.

Notes

  1. Note that we directly inject the noise into the original embedding to produce an augmented view in our implementation, which helps improve efficiency.

References

  • Atkinson O, Bhardwaj A, Englert C et al (2021) Anomaly detection with convolutional graph neural networks. J High Energy Phys 8:1–19

    Google Scholar 

  • Bag VV, Patil MB, Gaikwad VD et al (2024) Revolutionizing fashion: Fashion era’s deep convolutional neural network for outfit recommendations. Int J Intell Syst Appl Eng 12(15s):644–650

    Google Scholar 

  • Berg R, Kipf TN, Welling M (2017) Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263

  • Chang CC, Chang MY, Jhang JY et al (2022) Learning to extract expert teams in social networks. IEEE Trans Comput Soc Syst 9(5):1552–1562

    Article  Google Scholar 

  • Chen L, Wu L, Hong R, et al (2020) Revisiting graph based collaborative filtering: a linear residual graph convolutional network approach. In: Proceedings of the AAAI conference on artificial intelligence, pp 27–34

  • Chen YL, Yang DN, Shen CY et al (2018) On efficient processing of group and subsequent queries for social activity planning. IEEE Trans Knowl Data Eng 31(12):2364–2378

    Article  Google Scholar 

  • Ge Y, Liu S, Gao R, et al (2021) Towards long-term fairness in recommendation. In: Proceedings of the 14th ACM international conference on web search and data mining, pp 445–453

  • Harper FM, Konstan JA (2015) The movielens datasets: history and context. ACM Trans Interact Intell Syst (TIIS) 5(4):1–19

    Google Scholar 

  • He X, Liao L, Zhang H, et al (2017) Neural collaborative filtering. In: Proceedings of the 26th international conference on world wide web, pp 173–182

  • 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, pp 639–648

  • Hsu BY, Shen CY, Chang MY (2020) Wmego: willingness maximization for ego network data extraction in online social networks. In: Proceedings of the 29th ACM international conference on information and knowledge management, pp 515–524

  • Huang T, Dong Y, Ding M, et al (2021) Mixgcf: an improved training method for graph neural network-based recommender systems. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery and data mining, pp 665–674

  • Huang YL, Shen CY, Shieh S, et al (2009) Provable secure aka scheme with reliable key delegation in umts. In: 2009 Third IEEE international conference on secure software integration and reliability improvement, IEEE, pp 243–252

  • Jiang W, Luo J (2022) Graph neural network for traffic forecasting: a survey. Expert Syst Appl, 117921

  • Kearnes S, McCloskey K, Berndl M et al (2016) Molecular graph convolutions: moving beyond fingerprints. J Comput Aided Mol Des 30(8):595–608

    Article  Google Scholar 

  • Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. In: ICLR (Poster)

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

    Article  Google Scholar 

  • Lee D, Kang S, Ju H, et al (2021) Bootstrapping user and item representations for one-class collaborative filtering. In: Proceedings of the 44th International ACM SIGIR conference on research and development in information retrieval, pp 317–326

  • Liang D, Krishnan RG, Hoffman MD, et al (2018) Variational autoencoders for collaborative filtering. In: Proceedings of the 2018 world wide web conference, pp 689–698

  • Lin Z, Tian C, Hou Y et al (2022) Improving graph collaborative filtering with neighborhood-enriched contrastive learning. Proc ACM Web Conf 2022:2320–2329

    Google Scholar 

  • Lin Z, Tian C, Hou Y, et al (2022b) Improving graph collaborative filtering with neighborhood-enriched contrastive learning. In: WWW

  • Maurya SK, Liu X, Murata T (2022) Simplifying approach to node classification in graph neural networks. J Comput Sci 62:101695

    Article  Google Scholar 

  • Pan L, Shi C, Dokmanić I (2021) Neural link prediction with walk pooling. arXiv preprint arXiv:2110.04375

  • Paterek A (2007) Improving regularized singular value decomposition for collaborative filtering. In: Proceedings of KDD cup and workshop, pp 5–8

  • Rendle S, Freudenthaler C, Gantner Z, et al (2012) BPR: Bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618

  • Shchur O, Mumme M, Bojchevski A, et al (2018) Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868

  • Shen CY, Yang DN, Lee WC et al (2020) Activity organization for friend-making optimization in online social networks. IEEE Trans Knowl Data Eng 34(1):122–137

    Article  Google Scholar 

  • Shuai HH, Yang DN, Philip SY, et al (2013) On pattern preserving graph generation. In: 2013 IEEE 13th international conference on data mining, IEEE, pp 677–686

  • Sun J, Zhang Y, Ma C, et al (2019) Multi-graph convolution collaborative filtering. In: 2019 IEEE international conference on data mining (ICDM), IEEE, pp 1306–1311

  • Veličković P, Cucurull G, Casanova A, et al (2017) Graph attention networks. arXiv preprint arXiv:1710.10903

  • 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, pp 165–174

  • 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, pp 1001–1010

  • Wu F, Souza A, Zhang T, et al (2019) Simplifying graph convolutional networks. In: International conference on machine learning, PMLR, pp 6861–6871

  • 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, pp 726–735

  • Yang CH, Shen CY (2022) Enhancing machine learning approaches for graph optimization problems with diversifying graph augmentation. In: Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining, pp 2191–2201

  • Yao T, Yi X, Cheng DZ, et al (2021) Self-supervised learning for large-scale item recommendations. In: Proceedings of the 30th ACM international conference on information and knowledge management, pp 4321–4330

  • Yu J, Yin H, Gao M, et al (2021a) Socially-aware self-supervised tri-training for recommendation. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery and data mining, pp 2084–2092

  • Yu J, Yin H, Li J et al (2021) Self-supervised multi-channel hypergraph convolutional network for social recommendation. Proc Web Conf 2021:413–424

    Google Scholar 

  • Yu J, Yin H, Xia X, et al (2022a) 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, pp 1294–1303

  • Yu J, Yin H, Xia X, et al (2022b) Self-supervised learning for recommender systems: a survey. arXiv preprint arXiv:2203.15876

  • Zhao WX, Mu S, Hou Y, et al (2021) Recbole: towards a unified, comprehensive and efficient framework for recommendation algorithms. In: CIKM

  • Zheng L, Lu CT, Jiang F, et al (2018) Spectral collaborative filtering. In: Proceedings of the 12th ACM conference on recommender systems, pp 311–319

  • Zhu Y, Xu Y, Yu F et al (2021) Graph contrastive learning with adaptive augmentation. Proc Web Conf 2021:2069–2080

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Contributions

Diing-Ruey Tzeng, Chih-Ya Shen, and Chih-Chieh Chang wrote the main text of the introduction, preliminary analysis, and algorithm design. Diing-Ruey Tzeng and Ming-Yi Chang organized the related work and setup the experiments. All the authors revised the manuscript and discussed the experimental results. In particular, Diing-Ruey Tzeng, Chih-Ya Shen, and Ming-Yi Chang wrote the main body of the experimental results. Chia-Hsun Lu performs additional experiments on large-scale datasets, implements new baselines. Chia-Hsun Lu also surveys the related works and revise the paper.

Corresponding author

Correspondence to Chih-Ya Shen.

Ethics declarations

Conflict of interest

The authors have no conflict of interest to declare that are relevant to the content of this article.

Additional information

Responsible editor: Rita P. Ribeiro.

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

Chang, CC., Tzeng, DR., Lu, CH. et al. Improving graph-based recommendation with unraveled graph learning. Data Min Knowl Disc 38, 2440–2465 (2024). https://doi.org/10.1007/s10618-024-01038-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10618-024-01038-7

Keywords