Abstract
Graphs are a powerful tool for representing structured and relational data in various domains, including social networks, knowledge graphs, and molecular structures. Semi-supervised learning on graphs has emerged as a promising approach to address real-world challenges and applications. In this paper, we propose an uncertainty-aware pseudo-label selection framework for promoting diversity learning in recommendation systems. Our approach harnesses the power of semi-supervised graph neural networks, utilizing both labeled and unlabeled data, to address data sparsity issues often encountered in real-world recommendation scenarios. Pseudo-labeling, a prevalent semi-supervised method, combats label scarcity by enhancing the training set with high-confidence pseudo-labels for unlabeled nodes, enabling self-training cycles for supervised models. By incorporating pseudo-labels selected based on the model’s uncertainty, our framework is designed to improve the model’s generalization and foster diverse recommendations. The main contributions of this paper include introducing the uncertainty-aware pseudo-label selection framework, providing a comprehensive description of the framework, and presenting an experimental evaluation comparing its performance against baseline methods in terms of recommendation quality and diversity. Our proposed method demonstrates the effectiveness of uncertainty-aware pseudo-label selection in enhancing the diversity of recommendation systems and delivering a more engaging, personalized, and diverse set of suggestions for users.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Abbreviations
- \(\displaystyle a\) :
-
A scalar (integer or real)
- \(\mathcal {V}\) :
-
Set of nodes
- \(\mathbbm {1}\) :
-
Indicator Function
- \(\displaystyle {\varvec{a}}\) :
-
A vector
- \(\displaystyle {\varvec{A}}\) :
-
Adjacency matrix
- \(\displaystyle {{\textsf{A}}}\) :
-
A tensor
- \(\displaystyle {\mathcal {G}}\) :
-
The user-item interaction graph
- \(\displaystyle {\varvec{I}}_n\) :
-
Identity matrix with n rows and n columns
- \({v_1, v_2, \ldots , v_m}\) :
-
User nodes across the Graph
- \(\displaystyle \text {diag}({\varvec{a}})\) :
-
A square, diagonal matrix with diagonal entries given by \({\varvec{a}}\)
- \(\displaystyle {\textbf{a}}\) :
-
A vector-valued random variable
- \(\varvec{R} \in \mathbb {R}^{m \times n}\) :
-
Binary matrix with entries only 0 and 1 that represent user-item interactions in \({\mathcal {G}}\)
- \(\displaystyle {\varvec{I}}_i\) :
-
Element i of the item nodes, with indexing starting at 1
References
Abdollahpouri H, Adomavicius G, Burke R (2017) Controlling popularity bias in learning-to-rank recommendation. In: Proceedings of the eleventh ACM conference on recommender systems. ACM, pp 42–46
De Gemmis M, Lops P, Semeraro G, Basile P (2008) Integrating tags in a semantic content-based recommender. In: Proceedings of the 2008 ACM conference on recommender systems, pp 163–170
Dorigatti E, Goschenhofer J, Schubert B, Rezaei M, Bischl B (2022) Positive-unlabeled learning with uncertainty-aware pseudo-label selection. arXiv preprint arXiv:2201.13192
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
Fout A, Byrd J, Shariat B, Ben-Hur A (2017) Protein interface prediction using graph convolutional networks. Adv Neural Inf Process Syst 30
Gao C, Zheng Y, Li N, Li Y, Qin Y, Piao J, Quan Y, Chang J, Jin D, He X (2023) A survey of graph neural networks for recommender systems: challenges, methods, and directions. ACM Trans Recomm Syst 1(1):1–51
Ge M, Delgado-Battenfeld C, Jannach D (2010) Beyond accuracy: evaluating recommender systems by coverage and serendipity. Recomm Syst
Gunawardana A, Shani G, Yogev S (2012) Evaluating recommender systems. In: Recommender systems handbook. Springer, Berlin, pp 547–601
Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Adv Neural Inf Process Syst 30
He R, McAuley J (2016) Ups and downs: modeling the visual evolution of fashion trends with one-class collaborative filtering. In: Proceedings of the 25th international conference on world wide web, pp 507–517
Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907
Li Y, Yin J, Chen L (2023) Informative pseudo-labeling for graph neural networks with few labels. Data Min Knowl Disc 37(1):228–254
Liu J, Zhou T, Kuscsik Z, Medo M, Wakeling JR, Zhang Y-C (2010) Solving the apparent diversity-accuracy dilemma of recommender systems
McNee SM, Riedl J, Konstan JA (2006) Being accurate is not enough: how accuracy metrics have hurt recommender systems. In: CHI’06 extended abstracts on human factors in computing systems, pp 1097–1101
Miyato T, Maeda S-I, Koyama M, Ishii S (2018) Virtual adversarial training: a regularization method for supervised and semi-supervised learning. IEEE Trans Pattern Anal Mach Intell 41(8):1979–1993
Oord Avd, Li Y, Vinyals O (2018) Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748
Pal S, Regol F, Coates M (2019) Bayesian graph convolutional neural networks using node copying. arXiv preprint arXiv:1911.04965
Rizve MN, Duarte K, Rawat YS, Shah M (2021) In defense of pseudo-labeling: an uncertainty-aware pseudo-label selection framework for semi-supervised learning. arXiv preprint arXiv:2101.06329
Rossi E, Kenlay H, Gorinova MI, Chamberlain BP, Dong X, Bronstein MM (2022) On the unreasonable effectiveness of feature propagation in learning on graphs with missing node features. In: Learning on graphs conference, pp 11-1
Roy D, Dutta M (2022) A systematic review and research perspective on recommender systems. J Big Data 9(1):59
Sajjadi M, Javanmardi M, Tasdizen T (2016) Regularization with stochastic transformations and perturbations for deep semi-supervised learning. Advances in neural information processing systems, 29
Silveira T, Zhang M, Lin X, Liu Y, Ma S (2019) How good your recommender system is? A survey on evaluations in recommendation. Int J Mach Learn Cybern 10:813–831
Sun J, Guo W, Zhang D, Zhang Y, Regol F, Hu Y, Guo H, Tang R, Yuan H, He X (2020) A framework for recommending accurate and diverse items using bayesian graph convolutional neural networks. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery and data mining, pp 2030–2039
Velickovic P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. Stat 1050(20):10–48550
Wang X, He X, Wang M, Feng F, Chua T-S (2019) Neural graph collaborative filtering. In: Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval, pp 165–174
Wu Y, Xu Y, Singh A, Yang Y, Dubrawski A (2019) Active learning for graph neural networks via node feature propagation. arXiv preprint arXiv:1910.07567
Yadav N, Pal S, Singh AK (2023) Diversified recommendation using implicit content node embedding in heterogeneous information network. Multimedia Tools Appl, pp 1–31
Yang L, Wang S, Tao Y, Sun J, Liu X, Yu PS, Wang T (2023) DGREC: graph neural network for recommendation with diversified embedding generation. In: Proceedings of the sixteenth ACM international conference on web search and data mining, pp 661–669
Yi K, Wu J (2019) Probabilistic end-to-end noise correction for learning with noisy labels. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp 7017–7025
Zhang Y, Saghdha D, Quercia D, Jambor T (2012) Auralist: introducing serendipity into music recommendation. In: Proceedings of the fifth ACM international conference on web search and data mining. ACM, Berlin, pp 13–22
Zheng Y, Gao C, Chen L, Jin D, Li Y (2021) DGCN: diversified recommendation with graph convolutional networks. In: Proceedings of the web conference 2021, pp 401–412
Zhou T, Wang S, Bilmes J(2020) Time-consistent self-supervision for semi-supervised learning. In: International conference on machine learning, pp 11523–11533
Ziegler C-N, McNee SM, Konstan JA, Lausen G (2005) Improving recommendation lists through topic diversification. In: Proceedings of the 14th international conference on world wide web, pp 22–32
Author information
Authors and Affiliations
Corresponding author
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.
About this article
Cite this article
Cao, M., Tran, T. Uncertainty-aware graph neural network for semi-supervised diversified recommendation. Soc. Netw. Anal. Min. 14, 92 (2024). https://doi.org/10.1007/s13278-024-01242-9
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-024-01242-9