CateReg: category regularization of graph convolutional networks based collaborative filtering | Applied Intelligence Skip to main content
Springer Nature Link
Log in

CateReg: category regularization of graph convolutional networks based collaborative filtering

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Recent years have witnessed the compelling improvement of collaborative filtering (CF) techniques that enjoy the expressive power of graph convolutional networks (GCNs). Unfortunately, there is an intrinsic drawback that limits GCNs to benefit from deep architecture, namely, the oversmoothing phenomenon wherein all nodes in the graph asymptotically incline towards the same representation. We find that this issue also exists in graph neural network based CF models. To cope with this problem, in this work we propose a regularization technique termed CateReg that punishes the distances between two nodes in the embedding space according to the category(i.e., user-item, user-user and item-item interactions) of their relationships. By optimizing the calculation process, we reduce the time complexity of distance computing from o(n2) to o(n). The evaluation experiments are carried out over several representative recommendation datasets. The effectiveness of our regularization method is demonstrated with about 2.3% and 2.6% improvements on the state-of-the-art model w.r.t Recall and NDGC, 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
¥17,985 /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 includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

Explore related subjects

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

Notes

  1. Generally, representations and embeddings are interchangeable.

  2. https://github.com/THUIR/CC-CC/tree/master/dataset

    Table 2 Statistics of the experiment datasets
    Full size table

  3. http://ai-lab-challenge.bytedance.com/tce/vc/

  4. https://www.kaggle.com/c/kkbox-music-recommendation-challenge/data

  5. https://github.com/hexiangnan/adversarial_personalized_ranking/tree/master/Data

  6. https://grouplens.org/datasets/Movielens

  7. The t-test is performed by statistically comparing the average Recall/NDCG results of SGC and SGC+PR on 10 runs.

References

  1. van den Berg R, Kipf T, Welling M (2017) Graph convolutional matrix completion. arXiv:1706.02263

  2. Cai R, Wu J, San A, Wang C, Wang H (2021) Category-aware collaborative sequential recommendation proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval

  3. Cao D, He X, Miao L, Xiao G, Chen H, Xu J (2021) Social-enhanced attentive group recommendation. IEEE Trans Knowl Data Eng 33:1195–1209

    Article  Google Scholar 

  4. Chen C, Zhang M, Wang C, Ma W, Li M, Liu Y, Ma S (2019) An efficient adaptive transfer neural network for social-aware recommendation Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval

  5. Chen C, Zhang M, Zhang Y, Liu Y, Ma S (2020) Efficient neural matrix factorization without sampling for recommendation. ACM Trans Inf Syst (TOIS) 38:1–28

    Google Scholar 

  6. Chen L, Wu L, Hong R, Zhang K, Wang M (2020) Revisiting graph based collaborative filtering: a linear residual graph convolutional network approach. In: AAAI

  7. Chen M, Wei Z, Huang Z, Ding B, Li Y (2020) Simple and deep graph convolutional networks. In: International conference on machine learning. PMLR, pp 1725–1735

  8. Deng ZH, Huang L, Wang CD, Lai J, Yu PS (2019) Deepcf: a unified framework of representation learning and matching function learning in recommender system. In: AAAI, pp 61–68

  9. Fan W, Ma Y, Li Q, He Y, Zhao YE, Tang J, Yin D (2019) Graph neural networks for social recommendation. The world wide web conference

  10. Glorot X, Bengio Y (2010) Understanding the difficulty of training deep feedforward neural networks. In: AISTATS

  11. Guo L, Yin H, Chen T, Zhang X, Zheng K (2022) Hierarchical hyperedge embedding-based representation learning for group recommendation. ACM Trans Inf Syst 40:3:1–3:27

    Article  Google Scholar 

  12. He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) Lightgcn: simplifying and powering graph convolution network for recommendation. Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval

  13. He X, He Z, Du X, Chua TS (2018) Adversarial personalized ranking for recommendation. The 41st international ACM SIGIR conference on research & development in information retrieval

  14. He X, Liao L, Zhang H, Nie L, Hu X, Chua TS (2017) Neural collaborative filtering. Proceedings of the 26th international conference on world wide web

  15. Hu L, Xu S, Li C, Yang C, Shi C, Duan N, Xie X, Zhou M (2020) Graph neural news recommendation with unsupervised preference disentanglement. In: ACL

  16. Hu Y, Koren Y, Volinsky C (2008) Collaborative filtering for implicit feedback datasets. 2008 eighth IEEE international conference on data minin:263–272

  17. Huang C, Chen J, Xia L, Xu Y, Dai P, Chen Y, Bo L, Zhao J, Huang JX (2021) Graph-enhanced multi-task learning of multi-level transition dynamics for session-based recommendation. In: AAAI Conference on artificial intelligence (AAAI)

  18. Kipf T, Welling M (2017) Semi-supervised classification with graph convolutional networks. arXiv:1609.02907

  19. Klicpera J, Bojchevski A, Günnemann S. (2018) Predict then propagate: combining neural networks with personalized pagerank for classification on graphs. In: ICLR 2018

  20. Krichene W, Rendle S (2020) On sampled metrics for item recommendation proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining

  21. Li G, Müller M., Thabet AK, Ghanem B (2019) Deepgcns: can gcns go as deep as cnns. 2019 IEEE/CVF Int Conf Comput Vis (ICCV):9266–9275

  22. Liu C, Li X, Cai G, Dong Z, Zhu H, Shang L (2021) Non-invasive self-attention for side information fusion in sequential recommendation. In: AAAI

  23. Liu F, Cheng Z, Zhu L, Gao Z, Nie L (2021) Interest-aware message-passing gcn for recommendation. Proc Web Conf:2021

  24. van der Maaten L, Hinton GE (2008) Visualizing data using t-sne. J Mach Learn Res 9:2579–2605

    MATH  Google Scholar 

  25. Mao K, Zhu J, Xiao X, Lu B, Wang Z, He X (2021) Ultragcn: ultra simplification of graph convolutional networks for recommendation. Proc 30th ACM Int Conf Inf Knowl Manag

  26. Rong Y, bing Huang W, Xu T, Huang J (2020) Dropedge: towards deep graph convolutional networks on node classification. In: ICLR

  27. Ruxton GD (2006) The unequal variance t-test is an underused alternative to student’s t-test and the mann–whitney u test. Behavioral Ecology 17:688–690

    Article  Google Scholar 

  28. Sarwar BM, Karypis G, Konstan JA, Riedl J (2001) Item-based collaborative filtering recommendation algorithms. In: WWW ’01

  29. Shi S, Zhang M, Yu X, Zhang Y, Hao B, Liu Y, Ma S (2019) Adaptive feature sampling for recommendation with missing content feature values. Proc 28th ACM Int Conf Inf Knowl Manag

  30. Sun J, Zhang Y, Guo W, Guo H, Tang R, He X, Ma C, Coates MJ (2020) Neighbor interaction aware graph convolution networks for recommendation. Proc 43rd Int ACM SIGIR Conf Res Develop Inf Retrieval

  31. Velickovic P, Cucurull G, Casanova A, Romero A, Lio’ P., Bengio Y (2018) Graph attention networks. arXiv:1710.10903

  32. Wang X, He X, Cao Y, Liu M, Chua TS (2019) Kgat: knowledge graph attention network for recommendation. Proc 25th ACM SIGKDD Int Conf Knowl Discover Data Mining

  33. Wang X, He X, Wang M, Feng F, Chua TS (2019) Neural graph collaborative filtering. Proc 42nd Int ACM SIGIR Conf Res Develop Inf Retrieval

  34. Wu F, Souza A, Zhang T, Fifty C, Yu T, Weinberger K (2019) Simplifying graph convolutional networks. In: International conference on machine learning. PMLR, pp 6861–6871

  35. Wu J, He X, Wang X, Wang Q, Chen W, Lian J, Xie X, Zhang Y (2022) Graph convolution machine for context-aware recommender system. Frontiers Comput Sci 16:1–12

    Article  Google Scholar 

  36. Wu L, Sun P, Fu Y, Hong R, Wang X, Wang M (2019) A neural influence diffusion model for social recommendation. Proc 42nd Int ACM SIGIR Conf Res Develop Inf Retrieval

  37. Wu S, Tang Y, Zhu Y, Wang L, Xie X, Tan T (2019) Session-based recommendation with graph neural networks. In: AAAI

  38. Yang L, Luo L, Xin L, Zhang X, Zhang X (2021) Dagnn: demand-aware graph neural networks for session-based recommendation. arXiv:2105.14428

  39. Ying R, He R, Chen K, Eksombatchai P, Hamilton WL, Leskovec J (2018) Graph convolutional neural networks for web-scale recommender systems. Proc 24th ACM SIGKDD Int Conf Knowl Discover Data Mining

  40. Zhang J, Shi X, Zhao S, King I (2019) Star-gcn: Stacked and reconstructed graph convolutional networks for recommender systems. In: The 28th international joint conference on artificial intelligence, pp 4264–4270

  41. Zhang M, Chen Y (2020) Inductive matrix completion based on graph neural networks. arXiv: Information Retrieval

  42. Zhao L, Akoglu L (2020) Pairnorm: tackling oversmoothing in gnns. arXiv:1909.12223

  43. Zheng B, Wen H, Liang Y, Duan N, Che W, Jiang D, Zhou M, Liu T (2020) Document modeling with graph attention networks for multi-grained machine reading comprehension. arXiv:2005.05806

  44. Zheng L, Lu CT, Jiang F, Zhang J, Yu PS (2018) Spectral collaborative filtering. Proc 12th ACM Conf Recommend Syst

  45. Zheng X, Zhao G, Zhu L, Zhu J, Qian X (2022) What you like, what i am: online dating recommendation via matching individual preferences with features. IEEE Trans Knowl Data Eng

  46. Zhu H, Feng F, He X, Wang X, Li Y, Zheng K, Zhang Y (2020) Bilinear graph neural network with neighbor interactions. In: IJCAI

Download references

Author information

Authors and Affiliations

  1. Center for Intelligent and Networked Systems, School of Computer Science, Southwest Petroleum University, Chengdu, 610500, China

    Kaiwen Huang, Ping Li & Jinsong Zhao

  2. School of Computer Science, Southwest Petroleum University, Chengdu, 610500, China

    Jie Gong

Authors
  1. Kaiwen Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ping Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jinsong Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ping Li.

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 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

Huang, K., Gong, J., Li, P. et al. CateReg: category regularization of graph convolutional networks based collaborative filtering. Appl Intell 53, 10751–10765 (2023). https://doi.org/10.1007/s10489-022-04073-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-022-04073-3

Keywords

Search

Navigation