Skip to main content
SpringerLink
Log in

Evaluating Side Effects to Hide Sensitive Itemsets Through Transaction Deletion

  • Conference paper
  • First Online:
Knowledge Engineering and Management

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 278))

  • 1091 Accesses

Abstract

In this paper, a novel hiding-missing-artificial utility (HMAU) algorithm is proposed to hide sensitive itemsets through transaction deletion. It considers three side effects of hiding failure, missing itemsets, and artificial itemsets for evaluating whether the processed transactions are required to be deleted or not, in sanitization process. Experiments show that the proposed HMAU algorithm has better performance whether in the execution times, the number of deleted transactions, and the number of side effects.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agrawal R, Imielinski T, Sawmi A (1993) Mining association rules between sets of items in large databases. In: ACM SIGMOD international conference on management of data, vol 22, pp 207–216

    Google Scholar 

  2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: The international conference on very large data bases, pp 487–499

    Google Scholar 

  3. Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Syst Appl 34:2424–2435

    Article  Google Scholar 

  4. Lin CW, Hong TP, Lu WH (2009) The pre-fufp algorithm for incremental mining. Expert Syst Appl 36:9498–9505

    Article  Google Scholar 

  5. Agrawal R, Srikant R (1995) Mining sequential patterns. In: The international conference on data engineering, pp 3–14

    Google Scholar 

  6. Srikant R, Agrawal R (1996) Mining sequential patterns: generalizations and performance improvements. In: The international conference on extending database technology: advances in database technology, pp 3–17

    Google Scholar 

  7. Quinlan JR (1993) C4.5: Programs for machine learning, vol 16, pp 235–240

    Google Scholar 

  8. Berkhin P (2006) A survey of clustering data mining techniques. Grouping Multidimensional Data, pp 25–71

    Google Scholar 

  9. Jarvis RA, Patrick EA (1973) Clustering using a similarity measure based on shared near neighbours. IEEE Trans Comput 22:1025–1034

    Article  Google Scholar 

  10. Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Lect Notes Comput Sci 3518:689–695

    Article  Google Scholar 

  11. Lin CW, Hong TP, Lu WH (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38:7419–7424

    Article  Google Scholar 

  12. Lan GC, Hong TP, Tseng VS (2011) Discovery of high utility itemsets from on-shelf time periods of products. Expert Syst Appl 38:5851–5857

    Article  Google Scholar 

  13. Lin CW, Lan GC, Hong TP (2012) An incremental mining algorithm for high utility itemsets. Expert Syst Appl 39:7173–7180

    Article  Google Scholar 

  14. Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: ACM SIGMOD international conference on management of data, pp 439–450

    Google Scholar 

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

    Article  Google Scholar 

  16. Lin CW, Hong TP, Chang CC, Wang SL (2013) A greedy-based approach for hiding sensitive itemsets by transaction insertion. J Inf Hiding Multimedia Signal Process 4:201–227

    Google Scholar 

  17. Lin CW, Hong TP (2013) A survey of fuzzy web mining. Wiley Interdisc Rev Data Min Knowl Discovery 3:190–199

    Article  Google Scholar 

  18. Atallah M, Bertino E, Elmagarmid A, Ibrahim M, Verykios V (1999) Disclosure limitation of sensitive rules. In: The workshop on knowledge and data engineering exchange, pp 45–52

    Google Scholar 

  19. Gkoulalas-Divanis A, Verykios VS (2006) An integer programming approach for frequent itemset hiding. In: ACM international conference on information and knowledge management, pp 748–757

    Google Scholar 

  20. Oliveira SRM, Zaiane OR (2003) Protecting sensitive knowledge by data sanitization. In: IEEE international conference on data mining, pp 613–616

    Google Scholar 

  21. Wu YH, Chiang CM, Chen Arbee LP (2007) Hiding sensitive association rules with limited side effects. IEEE Trans Knowl Data Eng 19:29–42

    Article  Google Scholar 

  22. Leary DEO (1991) Knowledge discovery as a threat to database security. In: International conference on knowledge discovery and databases, pp 507–516

    Google Scholar 

  23. Zheng Z, Kohavi R, Mason L (2001) Real world performance of association rule algorithms. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 401–406

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Innoviative Information Industry Research Center, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China

    Chun-Wei Lin

  2. Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, 811, Taiwan, ROC

    Tzung-Pei Hong & Hung-Chuan Hsu

  3. Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan, ROC

    Tzung-Pei Hong

Authors
  1. Chun-Wei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tzung-Pei Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hung-Chuan Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tzung-Pei Hong .

Editor information

Editors and Affiliations

  1. College of Computer and Software Engineering, Shenzhen University, Shenzhen, China

    Zhenkun Wen

  2. School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China

    Tianrui Li

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, CW., Hong, TP., Hsu, HC. (2014). Evaluating Side Effects to Hide Sensitive Itemsets Through Transaction Deletion. In: Wen, Z., Li, T. (eds) Knowledge Engineering and Management. Advances in Intelligent Systems and Computing, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54930-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54930-4_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54929-8

  • Online ISBN: 978-3-642-54930-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation