首页 | 官方网站   微博 | 高级检索  
     

一种为保密挖掘预处理数据的新方法
引用本文:刘亮,谢舒婷,李顺东.一种为保密挖掘预处理数据的新方法[J].计算机科学,2011,38(7):165-169.
作者姓名:刘亮  谢舒婷  李顺东
作者单位:陕西师范大学计算机科学学院,西安,710062
基金项目:本文受国家自然科学基金(60673065,61070189),陕西省自然科学基金(2008K01-58)资助。
摘    要:Apriori算法是数据挖掘中一个里程碑式的经典算法,在该算法的思想上衍生出了许多通过产生频繁项集来导出关联规则的算法。提出了一种基于数据项闭包的、为保密数据挖掘进行数据预处理的全新方法。该方法针对类Apriori算法的特点和过程对不同特点的数据项进行不同的变换,使得挖掘请求方既能够正确地得到自己想要得到的关于己方产品的信息,又无法正确地得到关于潜在的竞争对手的信息。因此数据提供方在采用该方法预处理数据后,能够提供有利于双方的数据,以达到双赢的目的。

关 键 词:Apriori算法,隐私保护,数据项闭包,数据挖掘

New Data Preprocessing Method for Privacy-preserving Data Mining
LIU Liang,XIE Shu-ting,LI Shun-dong.New Data Preprocessing Method for Privacy-preserving Data Mining[J].Computer Science,2011,38(7):165-169.
Authors:LIU Liang  XIE Shu-ting  LI Shun-dong
Affiliation:(School of Computer Science,Shaanxi Normal University,Xi'an 710062,China)
Abstract:The Apriori algorithm is a milestone in the development of data mining. A number of other algorithms, which generate association rules by producing frectuent 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.
Keywords:Apriori algorithm  Privacy-prescrving  Item closure  Data mining
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号