Total views : 267

Frequent Pattern Technique using Federation Rule Mining

Affiliations

  • Department of Computer Science, Bharathiyar University, Coimbatore, Tamil Nadu, India
  • Computer Science Department, Rajah Serfoji Government College, Thanjavur, Tamil Nadu, India

Abstract


Objectives: To improve the security, as well as privacy while sharing data/information to third parties. From the database Duplicate data were eliminated and extracted the original database Methods/Statistical Analysis: FP tree based algorithm was proposed in this paper. It is used to generate the frequent item data sets. Those frequent data Item sets are extracted by using inverse data item set. It must achieve good security and privacy. Findings: The main problem in existing system is information leakage. In frequent pattern technique, federation rule mining process which tries to find some correlations and associations among the various types of data items in a dataset. It finds more privacy preserving techniques related to the data mining process. Applications/Improvement: To compare and evaluate the proposed of many algorithms, federation rule mining should able to maintain the data privacy in a proper manner.

Keywords

Federation Rule Mining, Frequent Pattern, Crypt Analysis, Data Contortion, Data Sensation.

Full Text:

 |  (PDF views: 190)

References


  • Dragos N, Trinca T. Fast and Cost-Effective Algorithms for Information Extraction in some Computational Domains. International Journal of Dissertation Abstracts. 2008; 70:01.
  • Bertino E, Lin D, Jiang W. Springer Publication: A Survey of Quantification of Privacy Preserving Data Mining Algorithms. 2008; 34:183-205.
  • Hemalatha R, Elamparithi M. Privacy Preserving Data Mining Using Sanitizing Algorithm. (IJCSIT) International Journal of Computer Science and Information Technologies. 2015; 6(5):4174-79.
  • Vaidya J. Clifton C, Kantarcioglu M, Patterson S. Privacypreserving decision trees over vertically partitioned data. 2008; 2(3):1-4.
  • Aruna Kumara T, Gunasekar. A Reconstruction Algorithm using Binary Transform for Privacy–Preserving Data Mining. Indian Journal of Science and Technology. 2016 May; 9(17):1-5.
  • Han J, Cheng H, Xin D, Yan X. Springer Publication: Frequent pattern mining: current status and future directions. 2007; 15(1):55-86.
  • Shuting XU, Zhang J, Han D, Wang J. Springer publication: Data Distortion for Privacy Protection in a Terrorist Analysis System. 2005; 3495:459–64.
  • Kamakshi K, Babu V. Preserving Privacy and Sharing the Data in Distributed Environment using Cryptographic Technique on Perturbed data. Journal of Computing. 2010; 2(4):115-19.
  • Liu L, Kantarcioglu M, Thuraisingham B. The Applicability of the Perturbation Model-based Privacy Preserving Data Mining for Real-world Data. Dallas, TX: Sixth IEEE International Conference on Data Mining-Workshops (ICDMW’ 06). 2006.
  • Dass R. Indian Institute of Management Ahmedabad: An Efficient Algorithm for Frequent Pattern Mining for RealTime Business Intelligence Analytics. 2005; p. 1-16.
  • Paul R, Groza T, Hunter J, Zankl A. Semantic interestingness measures for discovering association rules in the skeletal dysplasia domain. Journal of Biomedical Semantics. 2014; 5(8):1-4.
  • Shana J. A Cryptography Based Privacy Preserving Association Rule Mining in Academic Analytics. World Engineering & Applied Sciences Journal. 2015; 6(1):41-44.
  • Usha D, Rameshkumar K. A Complete Survey on application of Frequent Pattern Mining and Association Rule Mining on Crime Pattern Mining. International Journal of Advances in Computer Science and Technology. 2014; 3(4):1-12.
  • Aalst MP W V. A General Divide and Conquer Approach for Process Mining Architecture of Information Systems. Federated conference on computer science and information systems. 2013; p. 2.
  • Lindell Y, Pinkas B. Secure Multiparty Computation for Privacy-Preserving Data Mining. Journal of Privacy and Confidentiality. 2009; 1(1):59-98.

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.