DocumentCode
3227106
Title
Privacy preserving research based on association rule algorithm
Author
Zheng, Wei ; Li, Qingshui
Author_Institution
Comput. Sci. & Technol. Coll., Zhejiang Univ. of Technol., Hangzhou, China
fYear
2011
fDate
27-29 May 2011
Firstpage
254
Lastpage
257
Abstract
Privacy protection based on association rules aim is to find a data set of the original approach, making the mining of sensitive rules is to implement a data mining process is not to be found. To efficiently achieve privacy protection, this article combine the PPARM algorithm and IMBA algorithm, through the operation of sensitive items to do less, it will hidden sensitive rules more greater degree. It is making little effect on non-sensitive rules at the same time. That is making loss rate of the rules of the original database smaller. Theoretical and experimental results show that the algorithm is highly efficient, is a better method related to privacy protection.
Keywords
data mining; data privacy; very large databases; IMBA algorithm; PPARM algorithm; association rule algorithm; data set; database; hidden sensitive rules; nonsensitive rules; privacy preserving research; privacy protection; Association rules; Data mining; Privacy protection Sensitive rules; Rule loss rate;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on
Conference_Location
Xi´an
Print_ISBN
978-1-61284-485-5
Type
conf
DOI
10.1109/ICCSN.2011.6014045
Filename
6014045
Link To Document