Skip to main content
SpringerLink
Log in

Integrated Approach for Privacy Preserving Itemset Mining

  • Chapter
  • First Online:
Intelligent Control and Innovative Computing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 110))

Abstract

In this work, we propose an integrated itemset hiding algorithm that eliminates the need of pre-mining and post-mining and uses a simple heuristic in selecting the itemset and the item in itemset for distortion. Base algorithm (matrix-apriori) works without candidate generation so efficiency is increased. Performance evaluation demonstrates (1) the side effect (lost itemsets) and time while increasing the number of sensitive itemsets and support of itemset and (2) speed up by integrating the post mining.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Dunham M (2002) Data mining: introductory and advanced topics. Prentice Hall PTR Upper Saddle River, NJ, USA

    Google Scholar 

  2. Zhang N, Zhao W (2007) Privacy-preserving data mining systems. Computer 40(2):52–58

    Article  Google Scholar 

  3. Grossman R, Kasif S, Moore R, Rocke D, Ullman J Data mining research: opportunities and challenges [Online]. http://pubs.rgrossman.com/dl/misc-001_OnlinePDF.pdf. Accessed on May 31, 2010

  4. Yang Q, Wu X (2006) 10 challenging problems in data mining research. Int J Inform Technol Decision Making 5(4):597–604

    Article  Google Scholar 

  5. Kantardzic M (2002) Data mining: concepts, models, methods, and algorithms. John Wiley & Sons, Inc. New York, NY, USA

    Google Scholar 

  6. Han J, Kamber M (2005) Data mining: concepts and techniques. Morgan Kaufman, Publishers Inc. San Francisco, CA, USA

    Google Scholar 

  7. Atallah M, Bertino E, Elmagarmid A, Ibrahim M, Verykios V (1999) Disclosure limitation of sensitive rules. In: Proceedings of 1999 workshop on knowledge and data engineering exchange, KDEX ‘99, Chicago, 7 November 1999

    Google Scholar 

  8. Oliveira S, Zaiane O (2002) Privacy preserving frequent itemset mining, Proceedings of 2nd IEEE international conference on data mining, ICDM’02, Maebashi City, 9–12 December 2002

    Google Scholar 

  9. Verykios V, Elmagarmid A, Bertino E, Saygin Y, Dasseni E (2004) Association rule hiding. IEEE Trans Knowledge Data Eng 16(4):434–447

    Article  Google Scholar 

  10. Saygin Y, Verykios V, Clifton C (2001) Using unknowns to prevent discovery of association rules. ACM SIGMOD Records 30(4):45–54

    Article  Google Scholar 

  11. Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Records 29(2):1–12

    Article  Google Scholar 

  12. Wang S, Maskey R, Jafari A, Hong T (2008) Efficient sanitization of informative association rules. Exp Syst Appl 35(1–2):442–450

    Article  Google Scholar 

  13. Huang H, Wu X, Relue R (2002) Association analysis with one scan of databases. Proceedings second IEEE international conference on data mining, ICDM’02, Maebashi City, 9–12 December 2002, pp 629–632

    Google Scholar 

  14. Pavon J, Viana S, Gomez S (2006) Matrix apriori: speeding up the search for frequent patterns. Proceedings 24th IASTED international conference on databases and applications, DBA 2006, Innsbruck, 14–16 February 2006, pp 75–82

    Google Scholar 

  15. Yıldız B, Ergenç B (2010) Comparison of two association rule mining algorithms without candidate generation. In: Proceedings 10th IASTED international conference on artificial intelligence and applications, AIA 2010, Innsbruck, 15–17 February 2010, pp 450–457

    Google Scholar 

  16. Yıldız B, Ergenç B (2011) Hiding sensitive predictive frequent itemsets, lecture notes in engineering and computer science. In: Proceedings of the international multiconference of engineers and computer scientists 2011, IMECS 2011, Hong Kong, 16–18 March 2011, pp 339–345

    Google Scholar 

  17. Ahluwalia M, Gangopadhyay A (2008) Privacy preserving data mining: taxonomy of existing techniques. In: Subramanian R (ed) Computer security, privacy and politics: current issues, challenges and solutions. IRM, New York, pp 70–93

    Chapter  Google Scholar 

  18. Agrawal D, Aggarwal C (2001) On the design and quantification of privacy preserving data mining algorithms. Proceedings 20th ACM SIGMOD SIGACT-SIGART symposium on principles of database systems, PODS’01, CA, 21–24 May 2001, pp 247–255

    Google Scholar 

  19. Agrawal R, Srikant R (2000) Privacy-preserving data mining. ACM SIGMOD Records 29(2):439–450

    Article  Google Scholar 

  20. Liu L, Kantarcioglu M, Thuraisingham B (2008) The applicability of the perturbation based privacy preserving data mining for real-world data. Data Knowledge Eng 65(1):5–21

    Article  Google Scholar 

  21. Lindell Y, Pinkas B (2002) Privacy preserving data mining. J Crytol 15(3):177–206

    MathSciNet  MATH  Google Scholar 

  22. Pinkas B (2006) Cryptographic techniques for privacy-preserving data mining. ACM SIGKDD Explorations Newslett 4(2):12–19

    Article  Google Scholar 

  23. Bayardo R, Agrawal R (2005) Data privacy through optimal k-anonymization. Proceedings of 21st international conference on data engineering, ICDE’05, Tokyo, 5–8 April 2005, pp 217–228

    Google Scholar 

  24. Sweeney L (2002) Achieving k-anonymity privacy protection using generalization and suppression. Int J Uncertain, Fuzziness Knowledge-Based Syst 10(5):571–588

    Article  MathSciNet  Google Scholar 

  25. Brickell J, Shmatikov V (2008) The cost of privacy: destriction of data-mining utility in anonymized data publishing. Proceedings of 14th ACM SIGKDD international conference on knowledge discovery and data mining, KDD’08, Las Vegas, 24–27 August 2008, pp 70–78

    Google Scholar 

  26. Verykios V, Bertino E, Fovino I, Provenza L, Saygin Y, Theodoridis Y (2004) State-of-the-art in privacy preserving data mining. ACM SIGMOD Records 33(1):50–57

    Article  Google Scholar 

  27. Verykios V, Gkoulalas-Divanis A (2008) A survey of association rule hiding methods for privacy. In: Aggarwal C, Yu P (ed) Privacy-preserving data mining: models and algorithms. Springer, New York, pp 267–289

    Chapter  Google Scholar 

  28. Gkoulalas-Divanis A, Verykios V (2006) An integer programming approach for frequent itemset hiding. Proceedings of 15th ACM international conference on Information and knowledge management, CIKM’06, Virginia, 5–11 November 2006, pp 748–757

    Google Scholar 

  29. Gkolalas-Divanis A, Verykios V (2008) Exact knowledge hiding through database extension. IEEE Trans Knowledge Data Eng 21(5):699–713

    Article  Google Scholar 

  30. Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data Mining Knowledge Discov 1(3):241–258

    Article  Google Scholar 

  31. Sun X, Yu P (2005) A border-based approach for hiding sensitive frequent itemsets. Proceedings of 5th IEEE international conference on data mining, ICDM’05, Houston, 27–30 November 2005, pp 426–433

    Google Scholar 

  32. Sun X, Yu P (2007) Hiding sensitive frequent itemsets by a border-based approach. J Comput Sci Eng 1(1):74–94

    Article  Google Scholar 

  33. Mousakides G, Verykios V (2008) A max min approach for hiding frequent itemsets. Data Knowledge Eng 65(1):75–89

    Article  Google Scholar 

  34. Boora RK, Shukla R, Misra AK (2009) An improved approach to high level privacy preserving itemset mining. Int J Comput Sci Inform Security 6(3):216–223

    Google Scholar 

  35. Mohaisen A, Jho N, Hong D, Nyang D (2010) Privacy preserving association rule mining revisited: privacy enchancement and resource efficiency. IEICE Trans Inform Syst E93(2):315–325

    Article  Google Scholar 

  36. Lin JL, Liu JYC (2007) Privacy preserving itemset mining through fake transactions. Proceedings of 22nd ACM symposium on applied computing, SAC 2007, Seoul, 11–15 March 2007, pp 375–379

    Google Scholar 

  37. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. Proceedings of 20th international conference on very large data bases, VLDB’94, Santiago de Chile, 12–15 September 1994, pp 487–499

    Google Scholar 

  38. Cristofor L artool project [Online]. http://www.cs.umb.edu/~laur/ARtool/. Accessed on May 13, 2010

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Dokuz Eylul University, Buca-35160, Izmir, Turkey

    Barış Yıldız

  2. Department of Computer Engineering, Izmir Institute of Technology, Urla-35430, Izmir, Turkey

    Belgin Ergenç

Authors
  1. Barış Yıldız
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Belgin Ergenç
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Barış Yıldız .

Editor information

Editors and Affiliations

  1. International Association of Engineers, Hung To Road, Unit 1, 1/F, 37-39, Hong Kong, China

    Sio Iong Ao

  2. Computer Science, Tijuana Institute of Technology, Chula Vista, 91909, California, USA

    Oscar Castillo

  3. , Faculty of Information Sciences & Eng., University of Canberra, Canberra, 2601, Aust Capital Terr, Australia

    Xu Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Yıldız, B., Ergenç, B. (2012). Integrated Approach for Privacy Preserving Itemset Mining. In: Ao, S., Castillo, O., Huang, X. (eds) Intelligent Control and Innovative Computing. Lecture Notes in Electrical Engineering, vol 110. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1695-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-1695-1_19

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-1694-4

  • Online ISBN: 978-1-4614-1695-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation