Security and privacy concerned association rule mining technique for the accurate frequent pattern identification

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    Security and privacy has emerged to be a serious concern in which the business professional don’t desire to share their classified transaction data. In the earlier work, secured sharing of transaction databases are carried out. The performance of those methods is enhanced further by bringing in Security and Privacy aware Large Database Association Rule Mining (SPLD-ARM) framework. Now the Improved Secured Association Rule Mining (ISARM) is introduced for the horizontal and vertical segmentation of huge database. Then k-Anonymization methods referred to as suppression and generalization based Anonymization method is employed for privacy guarantee. At last, Diffie-Hellman encryption algorithm is presented in order to safeguard the sensitive information and for the storage service provider to work on encrypted information. The Diffie-Hellman algorithm is utilized for increasing the quality of the system on the overall by the generation of the secured keys and thus the actual data is protected more efficiently. Realization of the newly introduced technique is conducted in the java simulation environment that reveals that the newly introduced technique accomplishes privacy in addition to security.

  • Keywords

    Privacy, Anonymization, Security, Partitioning, Encryption, Quality of transaction database.

  • References

      [1] Frawley W, Piatetsky-Shapiro G & Matheus C, “Knowledge Discovery in Databases: An Overview”, AI Magazine, Fall, pp.213-228, (1992).

      [2] Santhi MA, “Application of Data Mining Using Snort rule for intrusion detection”, SSRG International Journal of Computer Science and Engineering, Vol.1, No.8, (2014).

      [3] Agrawal R & Srikant R, “Fast algorithms for mining association rules”, Proc. 20th Int. Conf. Very Large Data Bases, pp.487-499, (1994).

      [4] Agrawal R & Srikant R, “Fast algorithms for mining association rules in large databases”, Proc. 20th VLDB, (1994).

      [5] Han J, Pei J & Yin Y, “Mining frequent patterns without candidate generation”, Proc. ACM SIGMOD Int. Conf. Manage. Data, pp.1–12, (2000).

      [6] Muthu Lakshmi NV & Sandhya Rani K, “Privacy Preserving Association Rule Mining in Horizontally Partitioned Databases Using Cryptography Techniques”, International Journal of Computer Science and Information Technologies, Vol.3, No.1, pp.3176–3182, (2012).

      [7] Cheung DW, Han J, Ng VT, Fu A & Fu Y, “A fast distributed algorithm for mining association rules”, In Int. Conf. on Parallel and Distributed Information Systems, pp.31–44, (1996).

      [8] Yi X, Rao FY, Bertino E & Bouguettaya A, “Privacy-preserving association rule mining in cloud computing”, Proceedings of the 10th ACM symposium on information, computer and communications security, pp.439-450, (2015).

      [9] Solanki SK & Patel JT, “A Survey on Association Rule Mining”, Fifth International Conference on Advanced Computing & Communication Technologies, (2015).

      [10] Galárraga LA, Teflioudi C, Hose K & Suchanek F, “AMIE: association rule mining under incomplete evidence in ontological knowledge bases”, Proceedings of the 22nd international conference on World Wide Web, pp.413-422, (2013).

      [11] Seol WS, Jeong HW, Lee B & Youn HY, “Reduction of association rules for big data sets in socially-aware computing”, IEEE 16th International Conference on Computational Science and Engineering (CSE), pp.949-956, (2013).

      [12] Han J, Kamber M & Pei J, “Data mining: concepts & techniques”, Elsevier, (2011).

      [13] Anupriya E &Iyengar N.Ch.S.N., “A framework for optimizing the performance of peer-to-peer distributed data mining algorithms”, International Journal of Computing Science and Communication Technologies, Vol.3, No.1, (2010).

      [14] Le-Khac NA, Aouad L & Kechadi T, “Distributed knowledge map for mining data on grid platforms”, International Journal of Computer Science and Network 98 Security, Vol.7 No.10, (2007).

      [15] Emad Kadum Jabbar, “New Algorithms for Discovering Association Rules”, PHD. Thesis, Department of Computer Sciences of the University of Technology, (2005).

      [16] Silvestri C & Orlando S, “Distributed Approximate Mining of Frequent Patterns”, ACM Symposium on Applied Computing, Italy, (2005).

      [17] Zaiane OR, El-Hajj M & Lu P, “Fast Parallel Association Rule Mining without Candidacy Generation”, ICDM, pp.665–668, (2001).

      [18] Ahmed CF, Tanbeer SK, Jeong BS & Lee YK, “An efficient algorithm for sliding window-based weighted frequent pattern mining over data streams”, IEICE Transactions, Vol.92-D, No.7, pp.1369–1381, (2009).

      [19] Jabeen TN & Chidambaram M, “Privacy Preserving Association Rule Mining in Distributed Environments using Fp-Growth Algorithm and Elliptic Curve Cryptography”, Indian Journal of Science and Technology, Vol.9, No.48, (2017).

      Jabeen TN & Chidambaram M, “Frequent Pattern Technique using Federation Rule Mining”, Indian Journal of Science and Technology, Vol.9, No.38, (2016).




Article ID: 8908
DOI: 10.14419/ijet.v7i1.1.8908

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.