###
Journal of Software:2011.22(8):1749-1760

带学习的同步隐私保护频繁模式挖掘
郭宇红,童云海,唐世渭,吴冷冬
(国际关系学院 信息科技系,北京 100091;北京大学 机器感知与智能教育部重点实验室,北京 100871;Department of Computing Science, University of Alberta, Edmonton T6G 2R3, Canada)
Learning and Synchronized Privacy Preserving Frequent Pattern Mining
GUO Yu-Hong,TONG Yun-Hai,TANG Shi-Wei,WU Leng-Dong
(Department of Information Technology, University of International Relations, Beijing 100091, China; Key Laboratory of Machine Perception (Ministry of Education), Peking University, Beijing 100871, China;Department of Computing Science, University of Alberta, Edmonton T6G 2R3, Canada)
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3736   Download 3578
Received:April 16, 2010    Revised:January 20, 2011
> 中文摘要: 为了提高挖掘结果的准确性,提出基于样例学习和项集同步随机化的隐私保护频繁模式挖掘方法(learning and synchronized privacy preserving frequent pattern mining,简称LS-PPFM).该方法充分利用不需要隐私保护的个体数据,首先对不需要保护的数据学习,得到样例数据中蕴涵的强关联项,然后在对数据随机化时,将强关联项绑定在一起作同步随机化变换,以保持项与项之间的潜在关联性.实验结果表明,相对于项独立随机化,LS-PPFM 能够在略微牺牲一定的隐私保护性的情况下,显著提高频繁模式挖掘结果的准确性.
Abstract:To improve the accuracy of mining results, this paper proposes a method of privacy preserving frequent pattern mining, based on sample learning and synchronized randomization of itemset (LS-PPFM). The method utilizes the data of individuals who do not care privacy. First, the data that does not need protecting are learned, and some strongly associated items are obtained. Then, when the data is randomized, the associated items are bound together and randomized synchronously to try to keep their potential associations. Experimental results show that compared with independent randomization, LS-PPFM can achieve significant improvements on accuracy, while losing a little privacy.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(60403041, 60473072) 国家自然科学基金(60403041, 60473072)
Foundation items:
Reference text:

郭宇红,童云海,唐世渭,吴冷冬.带学习的同步隐私保护频繁模式挖掘.软件学报,2011,22(8):1749-1760

GUO Yu-Hong,TONG Yun-Hai,TANG Shi-Wei,WU Leng-Dong.Learning and Synchronized Privacy Preserving Frequent Pattern Mining.Journal of Software,2011,22(8):1749-1760