期刊文献+

一种简单的基于隐私保护的关联规则挖掘方法 被引量:6

Simple method on privacy preserving in association rules mining
下载PDF
导出
摘要 为了提高对隐私数据的保护程度和挖掘结果的准确性,提出一种有效的隐私保护关联规则挖掘方法。针对关联规则挖掘中需预先给出最小支持度和最小置信度这一条件,提出了一种简单的事务数据库中事务的处理方法,即隐藏那些包含敏感项目的关联规则的方法,对相关事务作处理,达到隐藏包含敏感项目的关联规则的目的。理论分析和实验结果均表明,基于事务处理的隐私保护关联规则挖掘方法具有很好的隐私性、简单性和适用性。 In order to raise the level of protection of data privacy and the accuracy of mining results,we propose an effective privacy preserving method.The minimum support and confidence should be given in associations mining,against this,a simple transactions handling method has been given.We can hide the associations which contain sensitive items by the way of dealing with transactions.Theoretical analysis and experimental results show that this method based on transaction processing has good privacy, simplicity and applicability.
出处 《计算机工程与应用》 CSCD 北大核心 2008年第28期130-132,共3页 Computer Engineering and Applications
基金 国家自然科学基金No.60475017 安徽省高等学校自然科学研究项目No.2006kj055B~~
关键词 隐私保护 关联规则 敏感项目 privacy preserving association rules sensitive item
  • 相关文献

参考文献5

二级参考文献21

  • 1Rakesh Agrawal,Tomasz Imieliński,et al.Mining association rules between sets of items in large databases[A].In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data[C].Washion D C,USA,1993.207-216.
  • 2J Vaidya,C Clifton.Privacy preserving association rule mining in vertically partitioned data[A].In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].Edmonton,Canada,2002.639-644.
  • 3R Agrawal,S Ramakrishnan.Privacy-preserving data mining[A].In Proceedings of of the 2000 ACM SIGMOD International Conference on Management of Data[C].Dallas,USA,2000.439-450.
  • 4Murat Kantarcioglu,Chris Clifton.Privacy-preserving distributed mining of association rules on horizontally partitioned data[A].Transactions on Knowledge and Data Engineering[C].IEEE Computer Society Press,Los Alamitos,CA,to appear.http://www.cs.purdue.edu/homes/clifton/document/Kantarcioglu.pdf.
  • 5Y Lindell,B Pinkas.Privacy preserving data mining[A].In Advances in Cryptology-CRYPTO'00,volume 1880 of Lecture Notes in Computer Science[C].Springer-Verlag,2000.36-54.
  • 6Wenliang Du,Zhijun Zhan.Using randomized response techniques for privacy preserving data mining[A].In Proceedings of The 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].Washington D C,USA,2003.505-510.
  • 7Zhijun Zhan,Wenliang Du.Privacy-Preserving Data Mining Using Multi-Group Randomized Response Techniques[R].Technical Report,June 2003.http://www.cis.syr.edu/~wedu/Research/paper/multi-group.pdf.
  • 8Y Saygin,V S Verykios,et al.Privacy preserving association rule mining[A].In Proceedings of the 12th International Workshop on Research Issues in Data Engineering:Engineering E-Commerce/E-Business Systems[C].2002.151-158.
  • 9A Ev mievski,R Srikant,et,al.Privacy preserving mining of association rules[A].In Proceedings of 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].Edmonton,Canada,2002.217-228.
  • 10Stanley RM Oliveira,Osmar R Zaane.Privacy preserving frequent itemset mining[A].In Proceedings of IEEE ICDM Workshop on Privacy,Security and Data Mining[C].Maebashi City,Japan,2002.43-54.

共引文献34

同被引文献58

引证文献6

二级引证文献39

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部