6 February 2012 in Computer Networks
27 January 2012 in International Journal of Communication Systems
25 March 2019 in IEEE Transactions on Knowledge and Data Engineering
In this paper, we study the problem of publishing high-dimensional data in a distributed multi-party environment under differential privacy. In particular, with the assistance of a semi-trusted curator, the parties collectively generate a synthetic integrated dataset while satisfying $\varepsilon$ -differential privacy. To solve this problem, we present a differentially private sequential update of Bayesian network (DP-SUBN) approach. In DP-SUBN, the parties and the curator collaboratively identify the Bayesian network $\mathbb{N}$ that best fits the integrated dataset in a sequential manner, from which a synthetic dataset can then be generated. The fundamental advantage of adopting the sequential update manner is that the parties can treat the intermediate results provided by previous parties as their prior knowledge to direct how to learn $\mathbb{N}$ . The core of DP-SUBN is the construction of the search frontier, which can be seen as a priori knowledge to guide the parties to update $\mathbb{N}$ . Leveraging the correlations of attribute pairs, we propose exact and heuristic methods to construct the search frontier. In particular, to privately quantify the correlations of attribute pairs without introducing too much noise, we first put forward a non-overlapping covering design (NOCD) method, and then devise a dynamic programming method for determining the optimal parameters used in NOCD. Through privacy analysis, we show that DP-SUBN satisfies $\varepsilon$ -differential privacy. Extensive experiments on real datasets demonstrate that DP-SUBN offers desirable data utility with low communication cost.
20 March 2018 in IEEE Access
With the rapid growth of scientific publications, research paper recommendation which suggests relevant research papers to users can bring great benefits to researchers. In this paper, we focus on the problem of recommending conference papers to the conference attendees. While most of the related existing methods depend on the content-based filtering, we propose a unified conference paper recommendation method named CPRec, which exploits both the contents and the authorship information of the papers. In particular, besides the contents, we exploit the relationships between a user and the authors of a paper for recommendation. In our method, we extract several features for a user-paper pair from the citation network, the coauthor network, and the contents, respectively. In addition, we derive a user’s pairwise preference towards the conference papers from the user’s bookmarked papers in each conference. Furthermore, we employ a pairwise learning to rank model which exploits the pairwise user preference to learn a function that predicts a user’s preference towards a paper based on the extracted features.We conduct a recommendation performance evaluation using real-world data and the experimental results demonstrate the effectiveness of our proposed method.
15 March 2019 in IEEE Transactions on Dependable and Secure Computing
In this paper, we study the problem of publishing vertically partitioned data under differential privacy, where different attributes of the same set of individuals are held by multiple parties. In this setting, with the assistance of a semi-trusted curator, the involved parties aim to collectively generate an integrated dataset while satisfying differential privacy for each local dataset. Based on the latent tree model (LTM), we present a differentially private latent tree (DPLT) approach, which is, to the best of our knowledge, the first approach to solving this challenging problem. In DPLT, the parties and the curator collaboratively identify the latent tree that best approximates the joint distribution of the integrated dataset, from which a synthetic dataset can be generated. The fundamental advantage of adopting LTM is that we can use the connections between a small number of latent attributes derived from each local dataset to capture the cross-dataset dependencies of the observed attributes in all local datasets such that the joint distribution of the integrated dataset can be learned with little injected noise and low computation and communication costs. Extensive experiments on real datasets demonstrate that DPLT offers desirable data utility with low computation and communication costs.
17 August 2016 in IEEE Transactions on Knowledge and Data Engineering
In this paper, we study the problem of mining frequent sequences under the rigorous differential privacy model. We explore the possibility of designing a differentially private frequent sequence mining (FSM) algorithm which can achieve both high data utility and a high degree of privacy. We found, in differentially private FSM, the amount of required noise is proportionate to the number of candidate sequences. If we could effectively prune those unpromising candidate sequences, the utility and privacy tradeoff can be significantly improved. To this end, by leveraging a sampling-based candidate pruning technique, we propose PFS $^2$ , a novel differentially private FSM algorithm. It is the first algorithm that supports the general gap-constrained FSM in the context of differential privacy. The gap constraints in FSM can be used to limit the mining results to a controlled set of frequent sequences. In our PFS $^2$ algorithm, the core is to utilize sample databases to prune the candidate sequences generated based on the downward closure property. In particular, we use the noisy local support of candidate sequences in the sample databases to estimate which candidate sequences are potentially frequent. To improve the accuracy of such private estimations, a gap-aware sequence shrinking method is proposed to enforce the length constraint on the sample databases. Moreover, to calibrate the amount of noise required by differential privacy, a gap-aware sensitivity computation method is proposed to obtain the sensitivity of the local support computations with different gap constraints. Furthermore, to decrease the probability of misestimating frequent sequences as infrequent, a threshold relaxation method is proposed to relax the user-specified threshold for the sample databases. Through formal privacy analysis, we show that our PFS $^2$ algorithm is $\epsilon$ -differentially private. Extensive experiments on real datasets illustrate that our PFS $^2$ algorithm can privately find frequent sequences with high accuracy.