Log in

Multiple hypergraph convolutional network social recommendation using dual contrastive learning

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

Abstract

Due to the strong representation capabilities of graph structures in social networks, social relationships are often used to improve recommendation quality. Most existing social recommendation models exploit pairwise relations to mine latent user preferences. However, since user interactions are relatively complex with possibly higher-order relationships, their performance in real-world applications is limited. Furthermore, user behavior data in many practical recommendation scenarios tend to be noisy and sparse, which may lead to suboptimal representation performance. To address this issue, we propose a dual objective contrastive learning multiple hypergraph convolution model for social recommendation (DCMHS). Specifically, our model first constructs hypergraphs with different social relationships. Then, we construct hypergraph encoders to obtain higher-order user representations through hypergraph convolution. Aiming to avoid aggregation loss caused by aggregating user embeddings under different views into one, we construct neighbor identification and semantic identification contrastive learning objectives to iteratively refine the user representation. In addition, we optimize the negative sampling process using the global embedding of items. The results of experiments conducted on real-world datasets demonstrate the effectiveness of the proposed DCMHS, and the ablation study validates the rationality of different components of the model.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.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 includes VAT (Germany)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  • Alexandridis G, Siolas G, Stafylopatis A (2017) Enhancing social collaborative filtering through the application of non-negative matrix factorization and exponential random graph models. Data Min Knowl Disc 31(4):1031–1059

    Article  MathSciNet  Google Scholar 

  • Bai S, Zhang F, Torr PH (2021) Hypergraph convolution and hypergraph attention. Pattern Recognit 110:107637

    Article  Google Scholar 

  • Bretto A (2013) Hypergraph theory. An introduction. Mathematical Engineering. Springer, Cham

    Book  Google Scholar 

  • Chen T, Kornblith S, Norouzi M, Hinton G (2020) A simple framework for contrastive learning of visual representations. In: International conference on machine learning, PMLR, pp 1597–1607

  • Chen H, Yin H, Sun X, Chen T, Gabrys B, Musial K (2020) Multi-level graph convolutional networks for cross-platform anchor link prediction. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1503–1511

  • Cialdini RB, Goldstein NJ (2004) Social influence: compliance and conformity. Annu Rev Psychol 55(1):591–621

    Article  Google Scholar 

  • Fan W, Ma Y, Li Q, He Y, Zhao E, Tang J, Yin D (2019) Graph neural networks for social recommendation. In: The world wide web conference, pp 417–426

  • Feng Y, You H, Zhang Z, Ji R, Gao Y (2019) Hypergraph neural networks. In: Proceedings of the AAAI conference on artificial intelligence, vol 33, pp 3558–3565

  • Giorgi J, Nitski O, Wang B, Bader G (2020) Declutr: Deep contrastive learning for unsupervised textual representations. Preprint ar**v:2006.03659

  • Han J, Tao Q, Tang Y, **a Y (2022) Dh-hgcn: Dual homogeneity hypergraph convolutional network for multiple social recommendations. In: Proceedings of the 45th International ACM SIGIR conference on research and development in information retrieval, pp 2190–2194

  • Hassani K, Khasahmadi AH (2020) Contrastive multi-view representation learning on graphs. In: International Conference on Machine Learning, PMLR, pp 4116–4126

  • He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (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

  • Hjelm RD, Fedorov A, Lavoie-Marchildon S, Grewal K, Bachman P, Trischler A, Bengio Y (2018) Learning deep representations by mutual information estimation and maximization. Preprint ar**v:1808.06670

  • Jamali M, Ester M (2010) A matrix factorization technique with trust propagation for recommendation in social networks. In: Proceedings of the Fourth ACM conference on recommender systems, pp135–142

  • Ji S, Feng Y, Ji R, Zhao X, Tang W, Gao Y (2020) Dual channel hypergraph collaborative filtering. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 2020–2029

  • **g B, **ang Y, Chen X, Chen Y, Tong H (2021) Graph-mvp: Multi-view prototypical contrastive learning for multiplex graphs. Preprint ar**v:2109.03560

  • Kipf T, Van der Pol E, Welling M (2019) Contrastive learning of structured world models. Preprint ar**v:1911.12247

  • Lee D, Shin K (2023) I’m me, we’re us, and i’m us: Tri-directional contrastive learning on hypergraphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 37, pp 8456–8464

  • Lin S, Liu C, Zhou P, Hu Z-Y, Wang S, Zhao R, Zheng Y, Lin L, **ng E, Liang X (2022) Prototypical graph contrastive learning. IEEE Trans Neural Netw Learn Syst

  • Lin Z, Tian C, Hou Y, Zhao WX (2022) Improving graph collaborative filtering with neighborhood-enriched contrastive learning. In: Proceedings of the ACM Web Conference 2022, pp 2320–2329

  • Liu L, Tang J, Han J, Yang S (2012) Learning influence from heterogeneous social networks. Data Min Knowl Disc 25(3):511–544

    Article  MathSciNet  Google Scholar 

  • Liu S, Ounis I, Macdonald C, Meng Z (2020) A heterogeneous graph neural model for cold-start recommendation. In: Proceedings of the 43rd International ACM SIGIR conference on research and development in information retrieval, pp 2029–2032

  • Ma H, Lyu MR, King I (2009) Learning to recommend with trust and distrust relationships. In: Proceedings of the Third ACM conference on recommender systems, pp 189–196

  • Ma H, Yang H, Lyu MR, King I (2008) Sorec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM conference on information and knowledge management, pp 931–940

  • Ma H, Zhou D, Liu C, Lyu MR, King I (2011) Recommender systems with social regularization. In: Proceedings of the Fourth ACM international conference on web search and data mining, pp 287–296

  • McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: Homophily in social networks. Annu Rev Sociol 415–444

  • Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2012) Bpr: Bayesian personalized ranking from implicit feedback. Preprint ar**v:1205.2618

  • Sankar A, Wang J, Krishnan A, Sundaram H (2020) Beyond localized graph neural networks: An attributed motif regularization framework. In: 2020 IEEE International Conference on Data Mining (ICDM), IEEE, pp 472–481

  • Song W, **ao Z, Wang Y, Charlin L, Zhang M, Tang J (2019) Session-based social recommendation via dynamic graph attention networks. In: Proceedings of the twelfth acm international conference on web search and data mining, pp 555–563

  • Sun J, Zhang Y, Ma C, Coates M, Guo H, Tang R, He X (2019) Multi-graph convolution collaborative filtering. In: 2019 IEEE International Conference on Data Mining (ICDM), IEEE, pp 1306–1311

  • Tang H, Zhao G, Wu Y, Qian X (2021) Multisample-based contrastive loss for top-k recommendation. IEEE Trans Multimedia

  • Tao Y, Gao M, Yu J, Wang Z, **ong Q, Wang X (2022) Predictive and contrastive: Dual-auxiliary learning for recommendation. Preprint ar**v:2203.03982

  • Velickovic P, Fedus W, Hamilton WL, Liò P, Bengio Y, Hjelm RD (2019) Deep graph infomax. ICLR (Poster) 2(3):4

    Google Scholar 

  • Wang J, Ding K, Hong L, Liu H, Caverlee J (2020) Next-item recommendation with sequential hypergraphs. In: Proceedings of the 43rd International ACM SIGIR conference on research and development in information retrieval, pp 1101–1110

  • Wei T, You Y, Chen T, Shen Y, He J, Wang Z (2022) Augmentations in hypergraph contrastive learning: Fabricated and generative. Advances in Neural Information Processing Systems 35:1909–1922

  • Wu L, Li J, Sun P, Hong R, Ge Y, Wang M (2020) Diffnet++: A neural influence and interest diffusion network for social recommendation. IEEE Trans Knowl Data Eng

  • Wu L, Sun P, Fu Y, Hong R, Wang X, Wang M (2019) A neural influence diffusion model for social recommendation. In: Proceedings of the 42nd International ACM SIGIR conference on research and development in information retrieval, pp 235–244

  • Wu J, Wang X, Feng F, He X, Chen L, Lian J, **e X (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

  • **a L, Huang C, Xu Y, Zhao J, Yin D, Huang J (2022) Hypergraph contrastive collaborative filtering. In: Proceedings of the 45th International ACM SIGIR conference on research and development in information retrieval, pp 70–79

  • **a L, Huang C, Zhang C (2022) Self-supervised hypergraph transformer for recommender systems. In: Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining, pp 2100–2109

  • Xu M, Wang H, Ni B, Guo H, Tang J (2021) Self-supervised graph-level representation learning with local and global structure. In: International conference on machine learning, PMLR, pp 11548–11558

  • Yang B, Lei Y, Liu J, Li W (2016) Social collaborative filtering by trust. IEEE Trans Pattern Anal Mach Intell 39(8):1633–1647

    Article  Google Scholar 

  • Yao T, Yi X, Cheng DZ, Felix XY, Menon AK, Hong L, Chi EH, Tjoa S, Kang J, Ettinger E (2020) Self-supervised learning for deep models in recommendations

  • Yin H, Wang Q, Zheng K, Li Z, Yang J, Zhou X (2019) Social influence-based group representation learning for group recommendation. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), IEEE, pp 566–577

  • Yu J, Gao M, Li J, Yin H, Liu H (2018) Adaptive implicit friends identification over heterogeneous network for social recommendation. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp 357–366

  • Yu J, Gao M, Yin H, Li J, Gao C, Wang Q (2019) Generating reliable friends via adversarial training to improve social recommendation. In: 2019 IEEE International Conference on Data Mining (ICDM), IEEE, pp 768–777

  • Yu J, Yin H, Li J, Gao M, Huang Z, Cui L (2020) Enhance social recommendation with adversarial graph convolutional networks. IEEE Trans Knowl Data Eng

  • Yu J, Yin H, Li J, Wang Q, Hung NQV, Zhang X (2021) Self-supervised multi-channel hypergraph convolutional network for social recommendation. In: Proceedings of the web conference 2021, pp 413–424

  • Yu J, Yin H, ** community. Inf Sci 479:55–75

    Article  Google Scholar 

  • Zhu Y, Xu Y, Yu F, Liu Q, Wu S, Wang L (2020) Deep graph contrastive representation learning. Preprint ar**v:2006.04131

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Grant No. 72074036, 62072060). This work is also supported by the Fundamental Research Funds for the Central Universities, Chongqing University with grant No. 2023CDJXY-036.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wei Zhou.

Additional information

Responsible editor: **grui He.

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

Wang, H., Zhou, W., Wen, J. et al. Multiple hypergraph convolutional network social recommendation using dual contrastive learning. Data Min Knowl Disc (2024). https://doi.org/10.1007/s10618-024-01021-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10618-024-01021-2

Keywords

Navigation