A heuristic data reduction approach for associative classification rule hiding

• Main Authors: Natwichai J., Sun X., Li X.
• Format: Conference or Workshop Item
• Language: English
• Published: 2014
• Online Access: http://www.scopus.com/inward/record.url?eid=2-s2.0-58349098012&partnerID=40&md5=05f62c50be0cdb79ab196f85bf2f52ea; http://cmuir.cmu.ac.th/handle/6653943832/1367
• Institution: Chiang Mai University

When data are to be shared between business partners, there could be some sensitive patterns which should not be disclosed to the other parties. On the other hand, the "quality" of the data must also be preserved. This creates an interesting question: how can we maintain the shared data that are guaranteed to have the quality, and the certain types of sensitive patterns be removed or "hidden"? In this paper, we address such the problem of sensitive classification rule hiding by using data reduction approach, i.e. removing the whole selected tuples in the given dataset. We focus on a specific type of classification rules, i.e. associative classification rules. In our context, a sensitive rule is hidden when its support falls below a minimal support threshold. Meanwhile, the impact on the data quality of the dataset is represented in term of a number of false-dropped rules, and a number of ghost rules. We present a few observations on the data quality with regard to the data reduction processes. From the observations, we can represent the impact by each reduction precisely without any re-applying the classification algorithm. Subsequently, we propose a heuristic algorithm to hide the sensitive rules based on the observations. Experimental results are presented to show the effectiveness and the efficiency of the proposed algorithm. © 2008 Springer Berlin Heidelberg.