期刊文献+

一种为保密挖掘预处理数据的新方法 被引量:1

New Data Preprocessing Method for Privacy-preserving Data Mining
下载PDF
导出
摘要 Apriori算法是数据挖掘中一个里程碑式的经典算法,在该算法的思想上衍生出了许多通过产生频繁项集来导出关联规则的算法。提出了一种基于数据项闭包的、为保密数据挖掘进行数据预处理的全新方法。该方法针对类Apriori算法的特点和过程对不同特点的数据项进行不同的变换,使得挖掘请求方既能够正确地得到自己想要得到的关于己方产品的信息,又无法正确地得到关于潜在的竞争对手的信息。因此数据提供方在采用该方法预处理数据后,能够提供有利于双方的数据,以达到双赢的目的。 The Apriori algorithm is a milestone in the development of data mining.A number of other algorithms,which generate association rules by producing frequent itemsets,are derived from it.This paper proposed a data preprocessing algorithm based on item closure,which is an absolutely new method for privacy-preserving data mining.According to the characteristics and the processes of Apriori-like algorithms,this method transforms different items in various ways.So the data mining applicant can only obtain the information of its own products correctly,but cannot obtain useful information regarding its potential competitors' products.Hence,through the application of this method,the cooperated data mining between the data provider and data miner will benefit both sides,and obtains a win-win result.
出处 《计算机科学》 CSCD 北大核心 2011年第7期165-169,共5页 Computer Science
基金 国家自然科学基金(60673065 61070189) 陕西省自然科学基金(2008K01-58)资助
关键词 APRIORI算法 隐私保护 数据项闭包 数据挖掘 Apriori algorithm Privacy-preserving Item closure Data mining
  • 相关文献

参考文献18

  • 1Agrawal R, Imieliflski T, et al. Mining asso-ciation rules between sets of items in large databases[C]// Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. Washion D. C. , USA, May 1993: 207-216.
  • 2Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules[C]//Proceedings of the 20th International Conference on Very Large Databases. Santiago, Chile, Sept. 1994 : 487-499.
  • 3HanJia-wei,MichelineK.数据挖掘:概念与技术(第二版)[M].范明,盂小峰,译.北京:机械工业出版社,2007.
  • 4Tavani H T. Information privacy, data mining, and the internct [J]. Ethics and Information Technology, 1999.1( 2 ): 137-145.
  • 5Lindell Y,Pinkas B. Privacy preserving data mining[J]. Journal of Cryptology, 2002.15(3) : 177-206.
  • 6Agrawal R, Evfimievski A, Srikant R. Information sharing ac- ross private databases[C]//Proceedings of the 2003 ACM SIG- MOD International Conference on Management of Data. New York: ACM Press, 2003 : 86-97.
  • 7Agrawal R, Srikant R. Privacy-preserving data mining [C]// Proceedings of the 2000 ACM SIGMOD Conference on Manage ment of Data. 2000:439-450.
  • 8Kantarcioglu M,Clifton C. Privacy-preserving distributed mining of association rules on horizontally partitioned data[J]. IEEE Transactions on Knowledge and Data Engineering, 2004,16 ( 9 ) : 1026-1037.
  • 9Du Wen-liang, Zhan Zhi-jun. Using randomized response tech niques for privacy-preserving data mining[C]//The 9th ACM SIGKDD Int'l Conf Knowledge Discovery in Databases and Da ta Mining. Washington D. C , USA, August 2003 : 24-27.
  • 10葛伟平,汪卫,周皓峰,施伯乐.基于隐私保护的分类挖掘[J].计算机研究与发展,2006,43(1):39-45. 被引量:20

二级参考文献155

共引文献304

同被引文献32

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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