protection of the information has been a long-term goal pursued by the database security research community and the government
statistical agencies. In this paper, we proposed greedy methods for hiding sensitive rules. The experimental results showed
the effectiveness of our approaches in terms of undesired side effects avoided in the rule hiding process. The results also
revealed that in most cases, all the sensitive rules are hidden without generating spurious rules. First, the good scalability
of our approach in terms of database sizes was achieved by using an efficient data structure, FCET, to store only maximal
frequent itemsets instead of storing all frequent itemsets. Furthermore, we also proposed a new framework for enforcing the
privacy in mining association rules. In the framework, we combined the techniques of efficiently hiding sensitive rules with
the transaction retrieval engine based on the FCET index tree. For hiding sensitive rules, the proposed greedy approach includes
a greedy approximation algorithm and a greedy exhausted algorithm to sanitize the database. In particular, we presented four
strategies in the sanitizing procedure and four strategies in the exposed procedure, respectively, for hiding a group of association
rules characterized as sensitive or artificial rules. In addition, the exposed procedure would expose missing rules during
the processing so that the number of missing rules could be lowered as much as possible.
- Content Type Journal Article
- Pages 1-14
- DOI 10.1007/s00500-010-0549-3
- Authors
- Chieh-Ming Wu, National Yunlin University of Science and Technology Graduate School of Engineering Science and Technology 123 University Road, Section 3, Touliu Yunlin 640 Taiwan, ROC
- Yin-Fu Huang, National Yunlin University of Science and Technology Department of Computer Science and Information Engineering 123 University Road, Section 3, Touliu Yunlin 640 Taiwan, ROC
- Journal Soft Computing – A Fusion of Foundations, Methodologies and Applications
- Online ISSN 1433-7479
- Print ISSN 1432-7643