A novel heuristic algorithm for privacy preserving of associative classification

• Main Authors: Harnsamut N., Natwichai J.
• Format: Conference or Workshop Item
• Language: English
• Published: 2014
• Online Access: http://www.scopus.com/inward/record.url?eid=2-s2.0-58349085212&partnerID=40&md5=2818c5e64ace03e9b630151aa043ad46; http://cmuir.cmu.ac.th/handle/6653943832/1378
• Institution: Chiang Mai University

Since individual data are being collected everywhere in the era of data explosion, privacy preserving has become a necessity for any data mining task. Therefore, data transformation to ensure privacy preservation is needed. Meanwhile, the transformed data must have quality to be used in the intended data mining task, i.e. the impact on the data quality with regard to the data mining task must be minimized. However, the data transformation problem to preserve the data privacy while minimizing the impact has been proven as an NP-hard. In this paper, we address the problem of maintaining the data quality in the scenarios which the transformed data will be used to build associative classification models. We propose a novel heuristic algorithm to preserve the privacy and maintain the data quality. Our heuristic is guided by the classification correction rate (CCR) of the given datasets. Our proposed algorithm is validated by experiments. From the experiments, the results show that the proposed algorithm is not only efficient, but also highly effective. © 2008 Springer Berlin Heidelberg.