Research Article Open Access

Hybrid Algorithm for Privacy Preserving Association Rule Mining

Ila Chandrakar, Yelipe Usha Rani, Mortha Manasa and Kondabala Renuka

Abstract

Problem statement: The objective of the hybrid algorithm for privacy preserving data mining is to hide certain sensitive information so that they cannot be discovered through association rule mining techniques. Approach: The sensitive items whether in Left Hand Side (LHS) or Right Hand Side (RHS) of the rule cannot be inferred through association rule mining algorithms by combining the concept of Increase Support of Left Hand Side (ISL) and Decrease Support of Right Hand Side (DSR) algorithms i.e., by increasing and decreasing the support of the LHS and RHS item of the rule respectively. Results: The efficiency of the proposed approach is compared with alone Increase Support of Left Hand Side (ISL) approach for real databases on the basis of number of rules pruned. Conclusion: The hybrid approach of ISL and DSR algorithms prunes more number of sensitive rules with same number of database scans.

Journal of Computer Science
Volume 6 No. 12, 2010, 1494-1498

DOI: https://doi.org/10.3844/jcssp.2010.1494.1498

Submitted On: 21 September 2010 Published On: 22 November 2010

How to Cite: Chandrakar, I., Rani, Y. U., Manasa, M. & Renuka, K. (2010). Hybrid Algorithm for Privacy Preserving Association Rule Mining. Journal of Computer Science, 6(12), 1494-1498. https://doi.org/10.3844/jcssp.2010.1494.1498

  • 2,998 Views
  • 3,209 Downloads
  • 6 Citations

Download

Keywords

  • Hybrid algorithm
  • association rule mining
  • privacy preserving
  • mining algorithms
  • sensitive items
  • hiding association