文章基本信息

标题：Distortion Based Algorithms for Privacy Preserving Frequent Item Set Mining
本地全文：下载
作者：K.Srinivasa Rao ; V.Chiranjeevi
期刊名称：International Journal of Data Mining & Knowledge Management Process
印刷版ISSN：2231-007X
电子版ISSN：2230-9608
出版年度：2011
卷号：1
期号：4
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Data mining services require accurate input data for their results to be meaningful, but privacy concerns may influence users to provide spurious information. In order to preserve the privacy of the client in data mining process, a variety of techniques based on random perturbation of data records have been proposed recently. We focus on an improved distortion process that tries to enhance the accuracy by selectively modifying the list of items. The normal distortion procedure does not provide the flexibility of tuning the probability parameters for balancing privacy and accuracy parameters, and each item's presence/absence is modified with an equal probability. In improved distortion technique, frequent one item-sets, and non- frequent one item-sets are modified with a different probabilities controlled by two probability parameters fp, nfp respectively. The owner of the data has a flexibility to tune these two probability parameters (fp and nfp) based on his/her requirement for privacy and accuracy. The experiments conducted on real time datasets confirmed that there is a significant increase in the accuracy at a very marginal cost in privacy.
关键词：Frequent patterns; sensitive patterns; non-sensitive patterns; legitimate patterns; Randomization ; privacy;preserving.