文献类型：期刊文献

英文题名：Discovering top-k patterns with differential privacy-an accurate approach

作者：Zhang, Xiaojian[1,2]; Meng, Xiaofeng[1]

第一作者：Zhang, Xiaojian;张啸剑

通讯作者：Zhang, Xiaojian

机构：[1] School of Information, Renmin University of China, Beijing, 100872, China; [2] School of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou, 450002, China

第一机构：School of Information, Renmin University of China, Beijing, 100872, China

通讯机构：[1]School of Information, Renmin University of China, Beijing, 100872, China

年份：2014

卷号：8

期号：5

起止页码：816-827

外文期刊名：Frontiers of Computer Science

收录：EI(收录号：20152400938592);Scopus(收录号：2-s2.0-85027950220)

语种：英文

外文关键词：Constraint satisfaction problems - Behavioral research - Health risks - Records management - Sensitive data - Data mining

摘要：Frequent pattern mining discovers sets of items that frequently appear together in a transactional database; these can serve valuable economic and research purposes. However, if the database contains sensitive data (e.g., user behavior records, electronic health records), directly releasing the discovered frequent patterns with support counts will carry significant risk to the privacy of individuals. In this paper, we study the problem of how to accurately find the top-k frequent patterns with noisy support counts on transactional databases while satisfying differential privacy. We propose an algorithm, called differentially private frequent pattern (DFP-Growth), that integrates a Laplace mechanism and an exponential mechanism to avoid privacy leakage. We theoretically prove that the proposed method is (λ, δ)-useful and differentially private. To boost the accuracy of the returned noisy support counts, we take consistency constraints into account to conduct constrained inference in the post-processing step. Extensive experiments, using several real datasets, confirm that our algorithm generates highly accurate noisy support counts and top-k frequent patterns. ? 2014, Higher Education Press and Springer-Verlag Berlin Heidelberg.