Hiding Sensitive Association Rules with Limited Side Effects
Authors:
- Chia-Ming ChiangCCChia-Ming Chiang
- 30 November 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 19 (1) , 29-42
Abstract
Data mining techniques have been widely used in various applications. However, the misuse of these techniques may lead to the disclosure of sensitive information. Researchers have recently made efforts at hiding sensitive association rules. Nevertheless, undesired side effects, e.g., nonsensitive rules falsely hidden and spurious rules falsely generated, may be produced in the rule hiding process. In this paper, we present a novel approach that strategically modifies a few transactions in the transaction database to decrease the supports or confidences of sensitive rules without producing the side effects. Since the correlation among rules can make it impossible to achieve this goal, in this paper, we propose heuristic methods for increasing the number of hidden sensitive rules and reducing the number of modified entries. The experimental results show the effectiveness of our approach, i.e., undesired side effects are avoided in the rule hiding process. The results also report that in most cases, all the sensitive rules are hidden without spurious rules falsely generated. Moreover, the good scalability of our approach in terms of database size and the influence of the correlation among rules on rule hiding are observedKeywords
This publication has 19 references indexed in Scilit:
- Privacy-preserving distributed mining of association rules on horizontally partitioned dataIEEE Transactions on Knowledge and Data Engineering, 2004
- Privacy preserving mining of association rulesInformation Systems, 2004
- Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree ApproachData Mining and Knowledge Discovery, 2004
- Disclosure limitation of sensitive rules2003
- Transforming data to satisfy privacy constraints2002
- Mining frequent item sets by opportunistic projection2002
- Maintaining Data Privacy in Association Rule Mining2002
- Hiding Association Rules by Using Confidence and Support2001
- Privacy-preserving data miningACM SIGMOD Record, 2000
- Scalable algorithms for association miningIEEE Transactions on Knowledge and Data Engineering, 2000