Peng Xue
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Peng Xue has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Jun Fan
China Telecom Digital Intelligence Techonology Co, Ltd
2 shared publications - Qian Gao
Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan, China
2 shared publications
Latest Publications
- 19 April 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (6) , 1-27
Social recommendation based on contrastive learning of hypergraph convolution
- 19 April 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (6) , 1-27
Social recommendation based on contrastive learning of hypergraph convolution
- Open Access
- 26 September 2023
- Published by Springer Nature in Research Square
Social Recommendation Based on Contrastive Learning of Hypergraph Convolution
Recommendation systems often use social relationships to improve recommendation quality in the face of sparse data. However, in reality, user interactions can be very complex, user relationships may be high-order, and the contribution of each neighbor may be different. Therefore, traditional social relationship methods cannot fully explore user interactions. Additionally, data sparsity can lead to poor model robustness, making it susceptible to noisy data. To address these issues, this paper proposes a multi-channel hypergraph convolutional network model based on contrastive learning, aiming to enhance social recommendation through high-order user relationships and contrastive learning. The model includes an embedding layer, a propagation layer, and a contrastive learning layer. For user embedding, each channel of the propagation layer learns high-order embedding information through hypergraph convolution. For item embedding, the neighbor-aware attention coefficient is used to mine the implicit correlations of items. In addition, the contrastive learning layer adds randomly uniform noise to the embedding to perform graph augmentation at the representation level, using contrastive learning to obtain more uniformly distributed embedding representations for score prediction. Experimental results on two real datasets, Douban and Yelp, show that the proposed model improves Recall and NDCG by 1.3%-2.1% and 2.0%-2.8%, respectively.
- 26 September 2023
- Published by Springer Nature in Research Square
Open AccessSocial Recommendation Based on Contrastive Learning of Hypergraph Convolution
Recommendation systems often use social relationships to improve recommendation quality in the face of sparse data. However, in reality, user interactions can be very complex, user relationships may be high-order, and the contribution of each neighbor may be different. Therefore, traditional social relationship methods cannot fully explore user interactions. Additionally, data sparsity can lead to poor model robustness, making it susceptible to noisy data. To address these issues, this paper proposes a multi-channel hypergraph convolutional network model based on contrastive learning, aiming to enhance social recommendation through high-order user relationships and contrastive learning. The model includes an embedding layer, a propagation layer, and a contrastive learning layer. For user embedding, each channel of the propagation layer learns high-order embedding information through hypergraph convolution. For item embedding, the neighbor-aware attention coefficient is used to mine the implicit correlations of items. In addition, the contrastive learning layer adds randomly uniform noise to the embedding to perform graph augmentation at the representation level, using contrastive learning to obtain more uniformly distributed embedding representations for score prediction. Experimental results on two real datasets, Douban and Yelp, show that the proposed model improves Recall and NDCG by 1.3%-2.1% and 2.0%-2.8%, respectively.