An Algorithm for Privacy-preserving Boolean Association Rule Mining
LUO Yong-long, HUANG Liu-sheng, JING Wei-wei, YAO Yi-fei, CHEN Guo-liang
Department of Computer Science,University of Science and Technology of China,Hefei,Anhui 230027,China; National High Performance Computing Center at Hefei,Hefei,Anhui 230027,China
Abstract：In distributed systems,some traditional association rules mining algorithms have been developed with all original data being gathered into a centralized site.However,these algorithms are not fit for the situation where no user is willing to disclose his information.In the privacy preserving association rule mining problems,there are several participants engaged in the computation and the algorithms are run on the union of their databases.Currently,the secure union algorithm can be used to protect each user's privacy if all the user's databases have the same structure.However,in secure union algorithm,each participant should encrypt all the participants' data.So,if there are many participants engaged in the cooperative computation,this method is inefficient.Thus,in this paper,we introduce a data disguised method for privacy preserving association rule mining based on the randomized response techniques,present the mining algorithm on the disguised item set and analyze the complexity of this algorithm.The experiments show that the rule that this algorithm gets has fewer relative error which is less than 2% compared with the original rules.We also give some values of the parameters which make the relative error is the lowest.
罗永龙;黄刘生;荆巍巍;姚亦飞;陈国良. 一个保护私有信息的布尔关联规则挖掘算法[J]. 电子学报, 2005, 33(5): 900-903.
LUO Yong-long;HUANG Liu-sheng;JING Wei-wei;YAO Yi-fei;CHEN Guo-liang. An Algorithm for Privacy-preserving Boolean Association Rule Mining. Chinese Journal of Electronics, 2005, 33(5): 900-903.
2005, Vol. 33 
