Skip to main content

Solving the Sensitive Itemset Hiding Problem Whilst Minimizing Side Effects on a Sanitized Database

  • Conference paper
Security-Enriched Urban Computing and Smart Grid (SUComS 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 223))

Abstract

Mining frequent itemsets from huge amounts of data is an important issue in data mining, with the retrieved information often being commercially valuable. However, some sensitive itemsets have to be hidden in the database due to privacy or security concerns. This study aimed to secure sensitive information contained in patterns extracted during association-rule mining. The proposed approach successfully hides sensitive itemsets whilst minimizing the impact of the sanitization process on nonsensitive itemsets. Our approach ensures that any modification to the database is controlled according to its impact on the sanitized database. The results of simulations demonstrate the benefits of our 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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure Limitation of Sensitive Rules. In: IEEE Workshop on Knowledge and Data Engineering Exchange, pp. 45–52 (1999)

    Google Scholar 

  2. Ayubia, S., Muyebab, M.K., Baraania, A., Keanec, J.: An Algorithm to Mine General Association Rules from Tabular Data. Information Sciences 179, 3520–3539 (2009)

    Article  MathSciNet  Google Scholar 

  3. Divanis, A.G., Verykios, V.S.: An Integer Programming Approach for Frequent Itemset Hiding. In: ACM International Conference on Information and Knowledge Management, pp. 748–757 (2006)

    Google Scholar 

  4. Divanis, A.G., Verykios, V.S.: Exact Knowledge Hiding Through Database Extension. IEEE Transactions on Knowledge and Data Engineering 21, 699–713 (2009)

    Article  Google Scholar 

  5. Gueret, C., Prins, C., Sevaux, M.: Applications of Optimization with Xpress-MP. Dash Optimization Ltd. (2002)

    Google Scholar 

  6. Lee, G., Chang, C.Y., Chen, A.L.P.: Hiding Sensitive Patterns in Association Rules Mining. In: Annual International Conference on Computer Software and Applications, pp. 424–429 (2004)

    Google Scholar 

  7. Menon, S., Sarkar, S., Mukherjree, S.: Maximizing Accuracy of Shared Databases when Concealing Sensitive Patterns. Information Systems Research 16, 256–270 (2004)

    Article  Google Scholar 

  8. Oliveira, S.R.M., Zaïane, O.R.: Privacy Preserving Frequent Itemset Mining. In: IEEE International Conference on Privacy, Security and Data Mining, pp. 43–54 (2002)

    Google Scholar 

  9. Oliveira, S.R.M., Zaïane, O.R.: Algorithms for Balancing Privacy and Knowledge Discovery in Association Rule Mining. In: Database Engineering and Applications Symposium, pp. 54–63 (2003)

    Google Scholar 

  10. Oliveira, S.R.M., Zaïane, O.R.: Protecting Sensitive Knowledge By Data Santization. In: IEEE International Conference on Data Mining, pp. 613–616 (2003)

    Google Scholar 

  11. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice-Hall, Englewood Cliffs (2003)

    MATH  Google Scholar 

  12. Sun, X., Yu, P.S.: Hiding Sensitive Frequent Itemsets by a Border-Based Approach. Computer Science and Engineering 1, 74–97 (2007)

    Article  Google Scholar 

  13. Sun, X., Yu, P.S.: A Border-Based Approach for Hiding Sensitive Frequent Itemsets. In: IEEE International Conference on Data Mining, pp. 426–433 (2005)

    Google Scholar 

  14. Verykios, V.S., Elmagarmid, A.K., Bertino, E., Saygin, Y., Dasseni, E.: Association Rule Hiding. IEEE Transactions on Knowledge and Data Engineering 16, 434–447 (2004)

    Article  Google Scholar 

  15. Wang, E.T., Lee, G., Lin, Y.T.: A Novel Method for Protecting Sensitive Knowledge in Association Rules Mining. In: IEEE Annual International Computer Software and Applications Conference, pp. 511–516 (2005)

    Google Scholar 

  16. Wang, E.T., Lee, G.: An Efficient Sanitization Algorithm for Balancing Information Privacy and Knowledge Discovery in Association Patterns Mining. Data and Knowledge Engineering 65, 463–484 (2008)

    Article  Google Scholar 

  17. Wu, Y.H., Chiang, C.C., Chen, A.L.P.: Hiding Sensitive Association Rules with Limited Side Effects. IEEE Transactions on Knowledge and Data Engineering 19, 29–42 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, G., Chen, YC., Peng, SL., Lin, JH. (2011). Solving the Sensitive Itemset Hiding Problem Whilst Minimizing Side Effects on a Sanitized Database. In: Chang, RS., Kim, Th., Peng, SL. (eds) Security-Enriched Urban Computing and Smart Grid. SUComS 2011. Communications in Computer and Information Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23948-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23948-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23947-2

  • Online ISBN: 978-3-642-23948-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics