Preferences help
enabled [disable] Abstract
Number of results
2016 | 41 | 68-75
Article title

A Survey on Privacy Preserving Data Mining

Title variants
Languages of publication
Privacy-preserving data mining has been considered widely because of the wide propagation of sensitive information over internet. A number of algorithmic techniques have been designed for privacy-preserving data mining that includes the state-of-the-art method. Privacy preserving data mining has become progressively popular because it allows sharing of confidential sensitive data for analysis purposes. It is important to maintain a ratio between privacy protection and knowledge discovery. To solve such problems many algorithms are proposed by various authors across the world. The main objective of this paper is to study various Privacy preserving data mining techniques and algorithms used for mining the item sets.
Physical description
  • Department of Computer Science and Engineering, Faculty of Engineering, Avinashilingam Institute for Home Science and Higher Education for Women, Coimbatore, India
  • Department of Computer Science and Engineering, Faculty of Engineering, Avinashilingam Institute for Home Science and Higher Education for Women, Coimbatore, India
  • [1] Srikant R., Agrawal R., Privacy-preserving data mining. SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data May 2000 Pages 439–450.
  • [2] Ryang, H., Yun, U., & Ryu, K. Discovering high utility item sets with multiple minimum support. Intelligent Data Analysis, vol. 18, no. 6, pp. 1027-1047, 2014
  • [3] Fouad, M. R., Elbassioni, K. M., &Bertino, E. (2014). A supermodularity-based differential privacy preserving algorithm for data anonymization. IEEE Transactions on Knowledge and Data Engineering, 26(7), pp. 1591-1601.
  • [4] Deokate Pallavi B.,& M.M. Waghmare. Privacy-Preserving in Outsourced Transaction Databases from Association Rules Mining, 2014. Corpus ID: 13552173
  • [5] A. S. Syed Navaz, M. Ravi, & T. Prabhu. Preventing Disclosure of Sensitive Knowledge by Hiding Inference. International Journal of Computer Applications 63(1) (2013) 32-38. DOI: 10.5120/10431-5104
  • [6] Li, Y., Chen, M., Li, Q., & Zhang, W. (2012). Enabling multilevel trust in privacy preserving data mining. IEEE Transactions on Knowledge and Data Engineering, 24(9), pp. 1598-1612.
  • [7] Tseng, V. S., Shie, B. E., Wu, C. W., & Yu, P. S. (2013). Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Transactions on Knowledge and Data Engineering, 25(8), pp. 1772-1786.
  • [8] Jiawei Han, Jianyong Wang, Ying Lu and P. Tzvetkov, Mining top-k frequent closed patterns without minimum support. 2002 IEEE International Conference on Data Mining, 2002. Proceedings. 2002, pp. 211-218, doi: 10.1109/ICDM.2002.1183905.
  • [9] Jieh-Shan Yeh, & Po-Chiang Hsu. HHUIF and MSICF: Novel algorithms for privacy preserving utility mining. Expert Systems with Applications, 37(7), pp. 4779-4786, 2010
  • [10] Yun, U., Ryang, H., & Ryu, K. (2014). High utility itemset mining with techniques for. reducing overestimated utilities and pruning candidates. Expert Systems with Applications, 41(8), pp. 3861-3878
  • [11] Phuong-Thanh La, Bac Le, Bay Vo, Incrementally building frequent closed itemset lattice. Expert Systems with Applications, Volume 41, Issue 6, 2014, Pages 2703-2712,
  • [12] Wang, T., & Liu, L. (2011). Output privacy in data mining. ACM Transactions on Database Systems, 36(1), pp. 1-34. article 1.
  • [13] Lee, G., Yun, U., & Ryu, K. (2014). Sliding window based weighted maximal frequent pattern mining over data streams. Expert Systems with Applications, 41(2), pp. 694-708.
  • [14] Dongwon Lee & Sung-Hyuk Park, Utility-based association rule mining: A marketing solution for cross-selling. Expert Systems with Applications, 40(7), pp. 2715-2725, 2013.
  • [15] Grigorios Loukides & Aris Gkoulalas-Divanis. Utility-preserving transaction data anonymization with low information loss. Expert Systems with Applications, 39(10), pp. 9764-9777, 2012.
  • [16] C. Saravanabhavan & R. M. S. Parvathi. Privacy preserving sensitive utility pattern mining. Journal of Theoretical and Applied Information Technology 49(2) (2013) 496-506
  • [17] Stanley R.M. Oliveira & Osmar R. Zaiane. Privacy Preserving Clustering by Data Transformation. Inaugural Issue of Journal of Information and Data Management Vol. 1 No. 1 (2010) 2010, 37-51
  • [18] Dasseni E., Verykios V.S., Elmagarmid A.K., Bertino E. (2001) Hiding Association Rules by Using Confidence and Support. In: Moskowitz I.S. (eds) Information Hiding. IH 2001. Lecture Notes in Computer Science, vol 2137. Springer, Berlin, Heidelberg.
Document Type
Publication order reference
YADDA identifier
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.