20 December 2022 in Knowledge-Based Systems
18 April 2025 in IEEE Transactions on Industrial Informatics
Matrix factorization-based recommendations have emerged as a cornerstone for many industrial recommendation algorithms. However, studies employing differential privacy often rely on a trusted server, while those implementing local differential privacy (LDP) frequently encounter substantial accuracy degradation and excessive communication overhead due to noise injection and frequent user interactions. Moreover, the presence of injected noise for privacy protection and inherent Gaussian noise within these perturbed values compounds the accuracy issues and may create a cascading effect under LDP, exacerbating the complexity of the problem at hand. To address these challenges, we propose MENTOR, which is Mixture model-based rEcommeNdations approach with matrix FacTORization under LDP. Its main idea lies in the adoption of a bounded input perturbation mechanism that closely approximates the Laplace distribution while providing rigorous LDP, coupled with accounting for various noise types present in the perturbed data. This approach allows us to reformulate the matrix factorization process with minimal user interaction, requiring only a single round of communication. In particular, to add noise, we design a bidirectional bounded LDP input perturbation mechanism BBV while minimizing variance. To generate recommendation results, we devise a matrix factorization technique GLMF based on a Gaussian–Laplacian mixture model. Comprehensive experiments reveal that MENTOR outperforms the state of the art by at least 15% in RMSE and 12% in F-Measure, showcasing its effectiveness in balancing privacy and utility in recommendation systems.
7 March 2025 in Information Fusion
19 October 2022 in IEEE Transactions on Big Data
Locations are usually necessary for task allocation in spatial crowdsourcing, which may put individual privacy in jeopardy without proper protection. Although existing studies have well explored the problem of location privacy protection in task allocation under geo-indistinguishability, they potentially assume the workers could perform any tasks, which might not be practical in reality. Moreover, they usually adopt planar laplacian mechanism to achieve geo-indistinguishability, which will introduce excessive noise due to its randomness and boundlessness. To this end, we propose a task allo CA tio N approach via gr O up-based nois E addition under Geo-I, referred to as CANOE . Its main idea is that each worker uploads the noisy distances between his true location and the obfuscated locations of his preferred tasks instead of uploading his obfuscated location. In particular, to alleviate the total noise when conducting grouping, we put forward an optimized global grouping with adaptive local adjustment method OGAL with convergence guarantee. To collect the noisy distances which are required for subsequent task allocation, we develop a utility-aware obfuscated distance collection method UODC with solid privacy and utility guarantees. We further theoretically analyze the privacy, utility and complexity guarantees of CANOE . Extensive analyses and experiments over two real-world datasets confirm the effectiveness of CANOE .
27 June 2022 in IEEE Transactions on Big Data
Truth discovery is an effective way to identify the aggregated truth of each task among multiple observed data drawn from different workers of varying reliabilities. However, existing studies are insufficient to protect individuals’ privacy, as they either just guarantee the weaker versions of local differential privacy (LDP) or potentially assume that the tasks are independent. In this paper, we, for the first time, investigate the problem of truth discovery while achieving the rigorous LDP for each worker with continuous inputs without the independence assumption. We present a locally differentially private truth discovery approach called PrivTDSI based on sampling and inference with solid privacy and utility guarantees. In PrivTDSI, the server first determines which values of each worker should be sampled according to a sample proportion and sends the indexes of these values to each worker. Then, each worker adds noise into the sampled values for privacy protection and uploads them to the server. After receiving the noisy sampled values from all the workers, the server first infers the unsampled values and then conducts truth discovery based on both the noisy sampled values and the inferred values. In particular, to determine the sample proportion, we formulate a constrained nonlinear programming problem and give a closed-form solution to this problem. Moreover, to determine which values of each worker should be sampled while avoiding the situation where the values of some workers or tasks might not be sampled at all, we develop a two-stage sampling method called TOSS. Furthermore, to infer the unsampled values accurately, we design a quality-aware inference method based on matrix factorization called QualityMF. Experimental results on two real-world datasets and a synthetic dataset demonstrate the effectiveness of $\mathit{PrivTDSI}$.
9 May 2025 in IEEE Transactions on Information Forensics and Security
Worker recruitment for area coverage maximization, typically requires participants to upload location information, which can deter potential participation without proper protection. While existing studies resort to geo-indistinguishability to address this concern, they primarily focus on either specific task locations (Target Coverage) or operate under pre-defined recruitment quotas for an interested region (Area Coverage). These focuses not only yield suboptimal area coverage when scaled but also fail to leverage valuable prior knowledge in the form of participants’ noisy historical registered locations, to enhance both location obfuscation and worker identification processes. To address these limitations, we present WILTON, which optimizes area coverage under geo-indistinguishability by recruiting the minimum number of participants through the strategic utilization of noisy prior knowledge. In WILTON, to generate obfuscated locations, we propose a probabilistic and weight-aware input perturbation mechanism, which groups and weights prior locations rather than using only personal prior locations. To privately identify the recruited workers, we design a grid-based worker identification method, which provides a worst-case performance guarantee of ratio 1 − 1/e to the optimum. We provide a theoretical analysis of the privacy, utility, and complexity guarantees of WILTON. Experimental results over two real-world datasets and one synthetic dataset show that WILTON surpasses the state-of-the-arts by at least 8% in area coverage improvement.