Journal of Computing Science and Engineering

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

Hiding Sensitive Frequent Itemsets by a Border-Based Approach

  • Published : 2007.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

Nowadays, sharing data among organizations is often required during the business collaboration. Data mining technology has enabled efficient extraction of knowledge from large databases. This, however, increases risks of disclosing the sensitive knowledge when the database is released to other parties. To address this privacy issue, one may sanitize the original database so that the sensitive knowledge is hidden. The challenge is to minimize the side effect on the quality of the sanitized database so that non-sensitive knowledge can still be mined. In this paper, we study such a problem in the context of hiding sensitive frequent itemsets by judiciously modifying the transactions in the database. Unlike previous work, we consider the quality of the sanitized database especially on preserving the non-sensitive frequent itemsets. To preserve the non-sensitive frequent itemsets, we propose a border-based approach to efficiently evaluate the impact of any modification to the database during the hiding process. The quality of database can be well maintained by greedily selecting the modifications with minimal side effect. Experiments results are also reported to show the effectiveness of the proposed approach.

Keywords

Cited by

  1. A transversal hypergraph approach for the frequent itemset hiding problem vol.47, pp.3, 2016, https://doi.org/10.1007/s10115-015-0862-3
  2. Association rule hiding using cuckoo optimization algorithm vol.64, 2016, https://doi.org/10.1016/j.eswa.2016.08.005
  3. Comprehensive Survey on Privacy Preserving Association Rule Mining: Models, Approaches, Techniques and Algorithms vol.23, pp.05, 2014, https://doi.org/10.1142/S0218213014500043
  4. Protecting Sensitive knowledge in association patterns mining vol.2, pp.1, 2012, https://doi.org/10.1002/widm.50
  5. Para Miner: a generic pattern mining algorithm for multi-core architectures vol.28, pp.3, 2014, https://doi.org/10.1007/s10618-013-0313-2
  6. Exact Knowledge Hiding through Database Extension vol.21, pp.5, 2009, https://doi.org/10.1109/TKDE.2008.199
  7. Association Rule Hiding Based on Intersection Lattice vol.2013, 2013, https://doi.org/10.1155/2013/210405
  8. Decision supporting method for chronic disease patients based on mining frequent pattern tree vol.74, pp.20, 2015, https://doi.org/10.1007/s11042-013-1730-3
  9. Full-Exact Approach for Frequent Itemset Hiding vol.11, pp.4, 2015, https://doi.org/10.4018/ijdwm.2015100103
  10. Efficient Association Rules Hiding Using Genetic Algorithms vol.10, pp.11, 2018, https://doi.org/10.3390/sym10110576
  11. Hiding sensitive itemsets without side effects pp.1573-7497, 2019, https://doi.org/10.1007/s10489-018-1329-5
  12. Dynamic Itemset Hiding Algorithm for Multiple Sensitive Support Thresholds vol.14, pp.2, 2018, https://doi.org/10.4018/IJDWM.2018040103