Skip to main content

Mining High Utility Itemsets Based on Transaction Deletion

  • Conference paper
  • First Online:

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

Abstract

In the past, an incremental algorithm for mining high utility itemsets was proposed to derive high utility itemsets in an incrementally inserted way. In real-world applications, transactions are not only inserted into but also deleted from a database. In this paper, a maintenance algorithm is thus proposed for reducing the execution time of maintaining high utility itemsets due to transaction deletion. Experimental results also show that the proposed maintenance algorithm runs much faster than the batch approach.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   329.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

Learn about institutional subscriptions

References

  1. Agrawal R, Imielinski T, Swami A (1993) Database Mining: a Performance Perspective. IEEE Trans Knowl Data Eng 5:914–925

    Article  Google Scholar 

  2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of 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. Park JS, Chen MS, Yu PS (1997) Using a hash-based method with transaction trimming for mining association rules. IEEE Trans Knowl Data Eng 9(5):813–825

    Article  Google Scholar 

  5. Liu Y, Liao WK, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: Proceedings of the international workshop on utility-based data mining, pp 90–99

    Google Scholar 

  6. Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of the siam international conference on data mining. pp 211–225

    Google Scholar 

  7. Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: Proceedings of IEEE international conference on data mining, pp 19–26

    Google Scholar 

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

    Google Scholar 

  9. 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 

  10. Yao H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59(3):603–626

    Article  Google Scholar 

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

    Article  Google Scholar 

  12. Cheung DW, Jiawei H, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the international conference on data engineering, pp 106–114

    Google Scholar 

  13. Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules. In: Proceedings of the international conference on database systems for advanced applications, pp 185–194

    Google Scholar 

  14. Hong TP, Wu CH (2010) An improved weighted clustering algorithm for determination of application nodes in heterogeneous sensor networks. J Inf Hiding Multimedia Sig Process 2(2):173–184

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  17. IBM: quest synthetic data generation code (1996) Available: http://www.almaden.ibm.com/cs/quest/syndata.html

Download references

Acknowledgments

This research was partially supported by Shenzhen peacock project, China, under contract No. KQC201109020055A, and Shenzhen Strategic Emerging Industries Program under Grants No. ZDSY20120613125016389.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chun-Wei Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Lin, CW., Lan, GC., Hong, TP., Kong, L. (2014). Mining High Utility Itemsets Based on Transaction Deletion. In: Huang, YM., Chao, HC., Deng, DJ., Park, J. (eds) Advanced Technologies, Embedded and Multimedia for Human-centric Computing. Lecture Notes in Electrical Engineering, vol 260. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-7262-5_112

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-7262-5_112

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-7261-8

  • Online ISBN: 978-94-007-7262-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics