Association rule hiding using integer linear programming

Suma B., Shobha G.

Abstract


Privacy preserving data mining has become the focus of attention of government statistical agencies and database security research community who are concerned with preventing privacy disclosure during data mining. Repositories of large datasets include sensitive rules that need to be concealed from unauthorized access. Hence, association rule hiding emerged as one of the powerful techniques for hiding sensitive knowledge that exists in data before it is published. In this paper, we present a constraint based optimization approach for hiding a set of sensitive association rules, using a well-structured Integer Linear Program formulation. The proposed approach reduces the database sanitization problem to an instance of the Integer Linear Programming problem. The solution of the Integer Linear Program determines the transactions that need to be sanitized in order to conceal the sensitive rules while minimizing the impact of sanitization on the non-sensitive rules. We also present a heuristic sanitization algorithm that performs hiding by reducing the support or the confidence of the sensitive rules. The results of the experimental evaluation of the proposed approach on real-life datasets indicate the promising performance of the approach in terms of side effects on the original database.

Keywords


association rule hiding; data sanitization; integer linear program; privacy preserving data mining; sensitive rules;



DOI: http://doi.org/10.11591/ijece.v11i4.pp%25p
Total views : 0 times


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578