Skip to main content

Privacy Preserving Association Rule Mining Using Binary Encoded NSGA-II

  • Conference paper
  • First Online:
Trends and Applications in Knowledge Discovery and Data Mining (PAKDD 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8643))

Included in the following conference series:

Abstract

When people utilize data mining techniques to discover useful knowledge behind a large database; they also have the requirement to preserve some information so as not to be mined out, such as sensitive or private association rules, classification tree and the like. A feasible way to address this problem is to sanitize the database to conceal sensitive information. In this paper, we focus on privacy preserving in association rule mining. In light of the tradeoff within the side effects accompanying the hiding process, we tackle this problem from a point view of multi-objective optimization. A novel association rule hiding approach was proposed based on evolutionary multi-objective optimization (EMO) algorithm. The binary encoding scheme was adopted in the EMO algorithm. Three side effects, including sensitive rules not hidden, non-sensitive lost rules and spurious rules were formulated as objectives to be minimized. The NSGA II algorithm, a well established EMO algorithm, was utilized to find a suitable subset of transactions to modify by removing items so that the three side effects are minimized. Experiment results were reported to show the effectiveness of the proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Verykios, V.S., Elmagarmid, A.K., et al.: Association rule hiding. IEEE Trans. Knowl. Data Eng. 16(4), 434–447 (2004)

    Article  Google Scholar 

  2. Atallah, M.B.E., Elmagarmid, A., Ibrahim, M., Verykios, V.S.: Disclosure limitation of sensitive rules. In: Proceedings of IEEE Workshop on Knowledge and Data Engineering Exchange, Chicago, IL, pp. 45–52 (1999)

    Google Scholar 

  3. Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding association rules by using confidence and support. In: Proceedings of the 4th International Workshop on Information Hiding, pp. 369–383 (2001)

    Google Scholar 

  4. Wu, Y.H., Chiang, C.C., Chen, A.L.P.: Hiding sensitive association rules with limited side effects. IEEE Trans. Knowl. Data Eng. 19(1), 29–42 (2007)

    Article  Google Scholar 

  5. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  6. Amiri, A.: Dare to share: Protecting sensitive knowledge with data sanitization. Decis. Support Syst. 43(1), 181–191 (2007)

    Article  Google Scholar 

  7. Verykios, V.S.: Association rule hiding methods. Wiley Interdisc. Rev. Data Min. Knowl. Disc. 3(1), 28–36 (2013)

    Article  Google Scholar 

  8. Sun, X., Yu, P.S.: A border-based approach for hiding sensitive frequent itemsets. In: Proceedings of Fifth IEEE International Conference on Data Mining (ICDM ’05), pp. 426–433, (2005)

    Google Scholar 

  9. Divanis, A.G., Verykios, V.S.: Exact knowledge hiding through database extension. IEEE Trans. Knowl. Data Eng. 21(5), 699–713 (2009)

    Article  Google Scholar 

  10. Hong, T.P., Lin, C.W., Yang, K.T., Wang, S.L.: Using TF-IDF to hide sensitive itemsets. Appl. Intell. 38(4), 502–510 (2013)

    Article  Google Scholar 

  11. Bleuler, S., Laumanns, M., Thiele, L., Zitzler, E.: PISA – a platform and programming language independent interface for search algorithms. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 494–508. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Agrawal, R., Imielinski, T., Sawmi, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on Management of Data (SIGMOD), pp. 207–216 (1993)

    Google Scholar 

  13. Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: Proceedings of the International Conference on Very Large Data Bases (VLDB), pp. 487–499 (1994)

    Google Scholar 

  14. Bodon, F.: Surprising results of trie-based FIM algorithms. In: Proceedings of IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI ’04), Brighton, UK (2004)

    Google Scholar 

  15. Bodon, F.: A fast APRIORI implementation. In: IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI ’03), Melbourne, Florida, USA (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jeng-Shyang Pan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Cheng, P., Pan, JS., Lin, CW. (2014). Privacy Preserving Association Rule Mining Using Binary Encoded NSGA-II. In: Peng, WC., et al. Trends and Applications in Knowledge Discovery and Data Mining. PAKDD 2014. Lecture Notes in Computer Science(), vol 8643. Springer, Cham. https://doi.org/10.1007/978-3-319-13186-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13186-3_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13185-6

  • Online ISBN: 978-3-319-13186-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics