摘要
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)资助