Hiding sensitive association rules to maintain privacy and data quality in database

Author

Domadiya, Nikunj H. ; Rao, Udai Pratap

Author_Institution

Comput. Sci. & Eng. Dept., Sardar Vallabhbhai Nat. Inst. of Technol., Surat, India

fYear

2013

fDate

22-23 Feb. 2013

Firstpage

1306

Lastpage

1310

Abstract

In this paper, we propose a heuristic based algorithm named MDSRRC (Modified Decrease Support of R.H.S. item of Rule Clusters) to hide the sensitive association rules with multiple items in consequent (R.H.S) and antecedent (L.H.S). This algorithm overcomes the limitation of existing rule hiding algorithm DSRRC. Proposed algorithm selects the items and transactions based on certain criteria which modify transactions to hide the sensitive information. Experimental result shows that proposed algorithm is highly efficient and maintains database quality.

Keywords

data encapsulation; data mining; data privacy; LHS; MDSRRC; data quality; database quality; heuristic based algorithm; modified decrease support of RHS item of rule clusters; privacy; rule hiding algorithm; sensitive association rule hiding; sensitive information hiding; Algorithm design and analysis; Association rules; Clustering algorithms; Data privacy; Databases; Sensitivity; Association rule; Privacy preserving data mining (PPDM); Sensitive pattern; Sensitivity;

fLanguage

English

Publisher

ieee

Conference_Titel

Advance Computing Conference (IACC), 2013 IEEE 3rd International

Conference_Location

Ghaziabad

Print_ISBN

978-1-4673-4527-9

Type

conf

DOI

10.1109/IAdCC.2013.6514417

Filename

6514417