Jiangzhou Deng
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
Research Interests
Jiangzhou Deng has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Yong Wang
Chongqing University of Posts and Telecommunications
16 shared publications - Zhiqiang Zhang
Chongqing University of Posts and Telecommunications
11 shared publications - Jianmei Ye
Sichuan Univ, Business Sch, 24 South Sect 1 Yihuan Rd, Chengdu 610064, Peoples R China
8 shared publications - Leo Yu Zhang
School of Information and Communication Technology, Griffith University, Southport, Queensland, Australia
5 shared publications Yong Wang
4 shared publications- Junpeng Guo
College of Management and Economics, Tianjin University, Tianjin, China
3 shared publications
Latest Publications
- 3 November 2026
- Published by Elsevier in Neural Networks
- Vol. 206
Debiased recommendation via diffusion-guided implicit graph augmentation with long-tail awareness
- 3 November 2026
- Published by Elsevier in Neural Networks
- Vol. 206
Debiased recommendation via diffusion-guided implicit graph augmentation with long-tail awareness
- 4 September 2026
- Published by Elsevier in Electronic Commerce Research and Applications
- Vol. 79
DTCAR: Dual-view temporal contrastive alignment for recommendation
- 4 September 2026
- Published by Elsevier in Electronic Commerce Research and Applications
- Vol. 79
DTCAR: Dual-view temporal contrastive alignment for recommendation
- 19 August 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
Alleviating gradient conflict via bias disentanglement and noise suppression for robust autoencoder recommendation
- 19 August 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
Alleviating gradient conflict via bias disentanglement and noise suppression for robust autoencoder recommendation
- 27 June 2026
- Published by Elsevier in Information Fusion
- Vol. 136
Representation Enhancement Learning with Dual-View Collaborative Fusion for Sequential Recommendation
- 27 June 2026
- Published by Elsevier in Information Fusion
- Vol. 136
Representation Enhancement Learning with Dual-View Collaborative Fusion for Sequential Recommendation
- 14 March 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (6)
Privacy-preserving heterogeneous graph representation learning for recommendation
- 14 March 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (6)
Privacy-preserving heterogeneous graph representation learning for recommendation
- 3 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 176
PGRM: Positive-unlabeled enhanced recommendation model based on generative adversarial network
- 3 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 176
PGRM: Positive-unlabeled enhanced recommendation model based on generative adversarial network
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (3) , 3572-3584
A Novel Differentially Private Implicit Recommendation Algorithm Based on Gradient Perturbation Optimization
With the explosive growth of digital data, recommendation systems (RSs) play a crucial role in alleviating the problem of information overload. Implicit feedback data has become the primary data source for training recommendation models because of its richness and ease of collection. Leveraging such data for personalized recommendation services requires a large amount of user historical interactions, which poses serious privacy risks. Differential privacy (DP) has been integrated into implicit recommendation algorithms to protect user privacy. However, due to the inherent characteristics of implicit feedback, the current studies still have certain deficiencies in terms of data utility and privacy level. To this end, this article proposes a novel differentially private implicit recommendation algorithm. It integrates the Bayesian personalized ranking (BPR) matrix factorization (MF) with the Gaussian mechanism in Rényi DP (RDP) and designs an optimization strategy based on the binary index tree (BIT) to alleviate the cumulative errors. The proposed method not only can effectively capture the user preferences from sparse implicit feedback data by maximizing the posterior probability of rankings but also can more precisely manage the privacy budget allocation according to the query matrix. The theoretical analyses prove that the proposed method can satisfy the privacy guarantee and give the upper bound of privacy loss. The experimental results show that our method outperforms several existing advanced methods. It achieves a maximum performance improvement of 6.5% and 6.9% on Hit Rate (HR@10) and Normalized Discounted Cumulative Gain (NDCG@10) at a low privacy budget, which indicates that it can provide good recommendation quality while ensuring a strict privacy level.
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (3) , 3572-3584
A Novel Differentially Private Implicit Recommendation Algorithm Based on Gradient Perturbation Optimization
With the explosive growth of digital data, recommendation systems (RSs) play a crucial role in alleviating the problem of information overload. Implicit feedback data has become the primary data source for training recommendation models because of its richness and ease of collection. Leveraging such data for personalized recommendation services requires a large amount of user historical interactions, which poses serious privacy risks. Differential privacy (DP) has been integrated into implicit recommendation algorithms to protect user privacy. However, due to the inherent characteristics of implicit feedback, the current studies still have certain deficiencies in terms of data utility and privacy level. To this end, this article proposes a novel differentially private implicit recommendation algorithm. It integrates the Bayesian personalized ranking (BPR) matrix factorization (MF) with the Gaussian mechanism in Rényi DP (RDP) and designs an optimization strategy based on the binary index tree (BIT) to alleviate the cumulative errors. The proposed method not only can effectively capture the user preferences from sparse implicit feedback data by maximizing the posterior probability of rankings but also can more precisely manage the privacy budget allocation according to the query matrix. The theoretical analyses prove that the proposed method can satisfy the privacy guarantee and give the upper bound of privacy loss. The experimental results show that our method outperforms several existing advanced methods. It achieves a maximum performance improvement of 6.5% and 6.9% on Hit Rate (HR@10) and Normalized Discounted Cumulative Gain (NDCG@10) at a low privacy budget, which indicates that it can provide good recommendation quality while ensuring a strict privacy level.
- 29 December 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (1) , 24
Adaptive disentangled learning recommendation via similarity popularity
- 29 December 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (1) , 24
Adaptive disentangled learning recommendation via similarity popularity
- Open Access
- 31 October 2025
- Published by Scilight Press Pty Ltd in Journal of Machine Learning and Information Security
- Vol. 1 (1) , 6
Bayesian Local Differential Privacy for Implicit Feedback Recommendation
Recommender systems have become indispensable tools for delivering personalized content. However, their reliance on user interaction data raises significant privacy concerns. Local Differential Privacy (LDP) offers strong privacy guarantees by perturbing user data at the client side before transmission. Yet, the noise introduced to ensure privacy often substantially degrades recommendation accuracy. To address this challenge, we propose a novel LDP-based recommendation algorithm grounded in Bayesian estimation. Our approach first applies a randomized response mechanism to locally perturb users’ implicit feedback and then leverages Bayesian inference on the server side to reconstruct the underlying user–item interaction probabilities. This two-stage framework effectively mitigates the adverse impact of injected noise while preserving rigorous privacy guarantees, thereby enabling high-quality model training even under stringent privacy constraints. Extensive experiments on three public benchmark datasets demonstrate that our method consistently outperforms state-of-the-art baselines, achieving a superior trade-off between privacy protection and recommendation utility. This work presents a practical, scalable solution for privacy-preserving recommendations—particularly valuable in settings involving untrusted servers and sparse interaction data.
- 31 October 2025
- Published by Scilight Press Pty Ltd in Journal of Machine Learning and Information Security
- Vol. 1 (1) , 6
Open AccessBayesian Local Differential Privacy for Implicit Feedback Recommendation
Recommender systems have become indispensable tools for delivering personalized content. However, their reliance on user interaction data raises significant privacy concerns. Local Differential Privacy (LDP) offers strong privacy guarantees by perturbing user data at the client side before transmission. Yet, the noise introduced to ensure privacy often substantially degrades recommendation accuracy. To address this challenge, we propose a novel LDP-based recommendation algorithm grounded in Bayesian estimation. Our approach first applies a randomized response mechanism to locally perturb users’ implicit feedback and then leverages Bayesian inference on the server side to reconstruct the underlying user–item interaction probabilities. This two-stage framework effectively mitigates the adverse impact of injected noise while preserving rigorous privacy guarantees, thereby enabling high-quality model training even under stringent privacy constraints. Extensive experiments on three public benchmark datasets demonstrate that our method consistently outperforms state-of-the-art baselines, achieving a superior trade-off between privacy protection and recommendation utility. This work presents a practical, scalable solution for privacy-preserving recommendations—particularly valuable in settings involving untrusted servers and sparse interaction data.