The week's pick
Random Articles
Reseach Article
Enhanced Batch Generation based Multilevel Trust Privacy Preserving in Data Mining
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 82 - Number 9 |
| Year of Publication: 2013 |
| Authors: B. Anitha, B. Hanmanthu, B. Raghu Ram |
10.5120/14144-1907
|
B. Anitha, B. Hanmanthu, B. Raghu Ram . Enhanced Batch Generation based Multilevel Trust Privacy Preserving in Data Mining. International Journal of Computer Applications. 82, 9 ( November 2013), 16-22. DOI=10.5120/14144-1907
Abstract
The motivation of Privacy Preserving Data Mining (PPDM) is to obtain valid data mining results without access to the original sensitive information. The different privacy preserving technique on Perturbation based PPDM approach introduces random perturbation to individual values to preserve privacy before data are published. This proposed work is based on perturbation based privacy preserving data mining. Here random perturbation approach is applied to provide privacy on the data set. Previously privacy is limited to single level trust in providing privacy to the data but now it is enhanced to multi level trust. The problem with existing multi level trust PPDM algorithms is that they fail to protect form non linear attacks. Considering that this proposed work make uses enhanced batch generation to provide privacy in the multi level trust in which data will perturb multiple times so that it can avoid non linear attacks.
References
- X. Xiao and Y. Tao, "Output Perturbation with Query Relaxation," Proc. Int'l Conf. Very Large Data Bases, 2008.
- K. Liu, H. Kargupta, and J. Ryan, "Random Projection-Based Multiplicative Data Perturbation for Privacy Preserving Distributed Data Mining," IEEE Trans. Knowledge and Data Eng. , vol. 18, no. 1, pp. 92-106, Jan. 2006.
- B. Bhattacharjee, N. Abe, K. Goldman, B. Zadrozny, V. R. Chillakuru, M. del Carpio, and C. Apte, "Using Secure Coprocessors for Privacy Preserving Collaborative Data Mining and Analysis," Proc. Second Int'l Workshop Data Management on New Hardware (DaMoN '06), 2006.
- B. Fung, K. Wang, A. Fu, and J. Pei, "Anonymity for Continuous Data Publishing," Proc. Int'l Conf. Extending Database Technology (EDBT), 2008.
- F. Li, J. Sun, S. Papadimitriou, G. Mihaila, and I. Stanoi, "Hiding in the Crowd: Privacy Preservation on Evolving Streams Through Correlation Tracking," Proc. IEEE 23rd Int'l Conf. Data Eng. (ICDE), 2007.
- G. Wang, Z. Zhu, W. Du, and Z. Teng, "Inference Analysis in Privacy-Preserving Data Re-Publishing," Proc. Int'l Conf. Data Mining, 2008.
- D. Kifer and J. E. Gehrke, "Injecting Utility Into Anonymized Datasets," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2006.
- A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam, "L-Diversity: Privacy Beyond K-Anonymity," Proc. Int'l Conf. Data Eng. , 2006.
- X. Xiao and Y. Tao, "Personalized Privacy Preservation," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2006.
- X. Xiao and Y. Tao, "M-Invariance: Towards Privacy Preserving Re-Publication of Dynamic Datasets," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2007.
- S. Papadimitriou, F. Li, G. Kollios, and P. S. Yu, "Time Series Compressibility and Privacy," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), 2007.
- X. Xiao, Y. Tao, and M. Chen, "Optimal Random Perturbation at Multiple Privacy Levels," Proc. Int'l Conf. Very Large Data Bases, 2009.
Index Terms
Keywords