项目名称: 满足差分隐私的频繁模式挖掘研究
项目编号: No.61502047
项目类型: 青年科学基金项目
立项/批准年度: 2016
项目学科: 自动化技术、计算机技术
项目作者: 程祥
作者单位: 北京邮电大学
项目金额: 21万元
中文摘要: 频繁模式挖掘是数据挖据领域最重要的基础性问题之一,具有广泛的应用。然而,如果数据集涉及个人敏感信息,直接发布或分享挖掘得到的频繁模式可能会导致严重的个人隐私泄露问题。近年来提出的差分隐私技术为解决上述问题提供了一种可行的方案。与传统的基于匿名的隐私保护模型不同,差分隐私提供了一种可证明的隐私保证,并且不依赖于攻击者所具有的背景知识。如何在满足差分隐私的条件下,提高挖掘结果的效用和挖掘效率是满足差分隐私的频繁模式挖掘面临的主要挑战。本项目拟针对项集、序列和子图三类主要模式,开展满足差分隐私的频繁模式挖掘研究。具体拟研究:1)满足差分隐私的基于深度优先搜索的频繁项集挖掘方法;2)满足差分隐私的带有间隙约束的频繁序列挖掘方法;3)满足差分隐私的基于拉普拉斯机制的频繁子图挖掘方法。研究成果将为满足差分隐私的频繁模式挖掘在实际领域中的应用以及满足差分隐私的频繁模式挖掘问题的进一步研究奠定坚实基础。
中文关键词: 差分隐私;频繁模式挖掘;频繁项集挖掘;频繁序列挖掘;频繁子图挖掘
英文摘要: Frequent pattern mining is one of the most fundamental problems in data mining, which has a wide range of applications. However, if the data sets involve sensitive personal information, directly publishing or sharing discovered frequent patterns might lead to serious privacy leakage. Differential privacy proposed in recent years provides a feasible way to address such problem. Unlike the anonymization-based privacy models, differential privacy offers a provable privacy guarantee without making assumptions about the adversary’s prior knowledge. How to improve the effectiveness and efficiency of mining while satisfying differential privacy is the major challenge for differentially private frequent pattern mining. In this project, we plan to study the differentially private frequent pattern mining problem for three main types of patterns, i.e., itemset, sequence and subgraph. In particular, we plan to study the following problems: 1) differentially private frequent itemset mining based on depth-first search; 2) differentially private frequent sequence mining with gap constraints; 3) differentially private frequent subgraph mining based on Laplace mechanism. Our research findings will build a solid foundation for the usage of differentially private frequent pattern mining in real-world applications and further studies.
英文关键词: Differential Privacy;Frequent Pattern Mining;Frequent Itemset Mining;Frequent Sequence Mining;Frequent Subgraph Mining