Associative classification rules hiding for privacy preservation Online publication date: Tue, 21-Oct-2014
by Juggapong Natwichai, Xingzhi Sun, Xue Li
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 5, No. 3, 2011
Abstract: Sensitive patterns could be discovered from the given data when the data are shared between business partners. Such patterns should not be disclosed to the other parties. However, the shared data should be credible and trustworthy for their 'quality'. In this paper, we address a problem of sensitive classification rule hiding by a data reduction approach. We focus on an important type of classification rules, i.e., associative classification rule. In our context, the impact on data quality generated by data reduction processes is represented by the number of false-dropped rules and ghost rules. To address the problem, we propose a few observations on the reduction approach. Subsequently, we propose a greedy algorithm for the problem based on the observations. Also, we apply two-bitmap indexes to improve the efficiency of the proposed algorithm. Experiment results are presented to show the effectiveness and the efficiency of the proposed algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook