Skip to content
Conference Open access

CAT-LDP: Cloud-Edge Adaptive Taxonomy Under Local Differential Privacy

Apr 2026 · 2026 11th International Conference on Cloud Computing and Big Data Analytics (ICCCBDA) · pp. 822-832 · 0 citations · 22 references
Computer Science

TL;DR

The results show that combining category-space modeling with cloud-local task decoupling can effectively reduce noise amplification in long-tail sparse settings and provide a better balance between privacy and utility for implicit-feedback recommendation.

Abstract

Recommender systems are widely used in daily life, but their direct collection and use of user preference data can also lead to privacy leakage. Existing privacy-preserving recommendation methods often find it hard to balance user privacy and recommendation performance. This problem is more serious in implicit-feedback settings, where data sparsity further increases the loss of useful signals caused by privacy perturbation. To solve this problem, we propose CAT-LDP, a cloud-local collaborative recommendation framework under local differential privacy constraints. CAT-LDP combines a hierarchical taxonomy tree with an adaptive privacy budget allocation strategy to keep more useful signals in users' active categories while protecting user privacy. Specifically, users upload perturbed category profiles that satisfy LDP. Based on these profiles, the cloud performs coarse-grained candidate generation, and the local device then carries out fine-grained reranking by using unperturbed local history. Experiments on the Amazon Video Games dataset show that CAT-LDP consistently outperforms its fixed-budget ablation variant and representative baselines on HR@K and NDCG@K under different privacy budgets. The results show that combining category-space modeling with cloud-local task decoupling can effectively reduce noise amplification in long-tail sparse settings and provide a better balance between privacy and utility for implicit-feedback recommendation.

Read PDF

Similar papers

Book Open access Aug 2026

PriCoRec: A Privacy-Aware Cloud–Device Collaborative Framework for Ad Recommendation under Feature Constraints

Privacy regulations increasingly restrict cloud processing of sensitive user data (e.g., age, gender), hindering traditional cloud-only recommendation models. To mitigate this challenge, we propose a Privacy-aware Collaborative cloud-device ads Recommendation framework (PriCoRec) which personalizes recommendations whil...

Dai-Rui Liu, Zhong-Yi Lu, Ji-Tao Lu et al. · 0 citations
Open access 2018

Supporting Privacy Protection in Personalized Web Search

The potency of Personalized web search (PWS) inenhancing the quality of diverse search services on the Internetis authenticated. Nevertheless, user’s disinclination to unfold their private information in the course of their search has created a vitalstop for the proliferation of PWS. We aspire to propose a PWS framewor...

Brahmaji Katragadda, Sk.Meera Shari · 0 citations
Book Open access Aug 2026

Learning in the Right Subspace: Personalized Differential Private Federated Learning with Noise Filtering

FedSPA, a Subspace Projection Aggregation personalized differential private Federated learning framework, is proposed, which not only effectively guides the aggregation of client personalized differential privacy but also reduces communication overhead.

Tianchi Liao, Xiaojun Deng, Le-Le Fu et al. · 0 citations
Conference Aug 2026

CoFARS-Sparse: A Context-Aware Recommendation Framework for Sparse E-Commerce Data

Predicting user behavior in extremely sparse data environments where users interact only once remains a fundamental challenge in e-commerce recommendation. While specialized domains like home decor face severe sparsity (where 87% of users exhibit single-interaction cold-start behavior), conventional context-aware seque...

Cong Le-Quoc Huynh, Dat Do, Chau Nguyen-Tri Vu et al. · 0 citations
Preprint Aug 2026

Residual Privacy Budgeting with Weighted Scarcity Allocation for Online Query Answering

A scarcity impossibility result shows that no online allocator can guarantee a competitive ratio better than 1/n in threshold satisfaction, contextualising the QIF scarcity layer as a design choice for an inherently hard online problem.

Mina Khoshmehr, F. Beltrán · 0 citations
Preprint Aug 2026

SAHC-NS: Structure-Aware and Hardness-Calibrated Negative Sampling for Implicit Collaborative Filtering

Negative sampling is a key component of implicit collaborative filtering (CF), as it enables recommenders to effectively learn user preferences. Existing negative sampling methods mostly follow a two-stage paradigm: they first construct a candidate negative pool for each user and then select negative samples from the p...

Jia-Yi Wu, Zheng-Yu Wu, Xun-Kai Li et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.