Paper Details

In this Project we are applying a heuristic based algorithm named FADSRRC (Fast Algorithm for DecreaseSupport of R.H.S item of Rule Clusters) to hide the sensitive association rules from sensitive item set with multiple items insubsequent (R.H.S) and precedent (L.H.S). This algorithm overcomes the limitation of existing rule hiding algorithmDSRRC andMDSRRC. PPDM techniques are helpful to enhance the security of database. FADSRRC algorithm selects theitems and transactions according to some circumstances which remodels transactions to prevent the sensitive informationfrom getting leaked and by using FADSRRC algorithm we can hide more sensitive data from sensitive item sets. Theproposed FADSRRC algorithm is highly efficient and conserves the virtue of database. And also it gives more accuracythan both the algorithm MDSRRC and DSRRC.Association rule hiding problem can be defined as: convert the original database into sanitized database so that datamining techniques will not be able to mine sensitive rules from the database while all non-sensitive rules remain visible.Association rule mining technique is widely used in data mining to find consociation between item sets.

Gayatri Bagul, Pooja Katkar, Nupoor Kumbhar, Pallavi Patil, “Sensitive data hiding with the mining of association rules”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 3, Issue 13, pp. -, January 2016.