Mining High Utility Itemsets Based on Transaction Deletion

  • Chun-Wei Lin
  • Guo-Cheng Lan
  • Tzung-Pei Hong
  • Linping Kong
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (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.

Keywords

Utility mining Maintenance Transaction deletion Two-phase approach FUP concept 

Notes

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.

References

  1. 1.
    Agrawal R, Imielinski T, Swami A (1993) Database Mining: a Performance Perspective. IEEE Trans Knowl Data Eng 5:914–925CrossRefGoogle Scholar
  2. 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–499Google Scholar
  3. 3.
    Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Syst Appl 34:2424–2435CrossRefGoogle Scholar
  4. 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–825CrossRefGoogle Scholar
  5. 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–99Google Scholar
  6. 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–225Google Scholar
  7. 7.
    Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: Proceedings of IEEE international conference on data mining, pp 19–26Google Scholar
  8. 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–5857Google Scholar
  9. 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–695CrossRefGoogle Scholar
  10. 10.
    Yao H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59(3):603–626CrossRefGoogle Scholar
  11. 11.
    Lin CW, Lan GC, Hong TP (2012) An incremental mining algorithm for high utility itemsets. Expert Syst Appl 39(8):7173–7180CrossRefGoogle Scholar
  12. 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–114Google Scholar
  13. 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–194Google Scholar
  14. 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–184Google Scholar
  15. 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–227Google Scholar
  16. 16.
    Lin CW, Hong TP (2013) A survey of fuzzy web mining. Wiley Interdisc Rev: Data Min Knowl Discovery 3:190–199CrossRefGoogle Scholar
  17. 17.
    IBM: quest synthetic data generation code (1996) Available: http://www.almaden.ibm.com/cs/quest/syndata.html

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  • Chun-Wei Lin
    • 1
    • 2
  • Guo-Cheng Lan
    • 3
  • Tzung-Pei Hong
    • 4
    • 5
  • Linping Kong
    • 1
  1. 1.IIIRC, School of Computer Science and TechnologyInstitute of Technology Shenzhen Graduate SchoolXili, ShenzhenPeople’s Republic of China
  2. 2.Shenzhen Key Laboratory of Internet Information Collaboration HarbinInstitute of Technology Shenzhen Graduate SchoolXili, ShenzhenPeople’s Republic of China
  3. 3.Department of Computer Science and Information EngineeringNational Cheng Kung UniversityTainanTaiwan, Republic of China
  4. 4.Department of Computer Science and Information EngineeringNational University of KaohsiungKaohsiungTaiwan, Republic of China
  5. 5.Department of Computer Science and EngineeringNational Sun Yat-sen UniversityKaohsiungTaiwan, Republic of China

Personalised recommendations