Skip to main content
Springer Nature Link
Log in

Incrementally Updating High-Utility Itemsets with Transaction Insertion

  • Conference paper
Advanced Data Mining and Applications (ADMA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8933))

Included in the following conference series:

  • 3349 Accesses

Abstract

High-utility itemsets mining (HUIM) is designed to solve the limitations of association-rule mining by considering both the quantity and profit measures. Most algorithms of HUIM are designed to handle the static database. Fewer research handles the dynamic HUIM with transaction insertion, thus requiring the computations of database rescan and combination explosion of pattern-growth mechanism. In this paper, an efficient incremental algorithm with transaction insertion is designed to reduce computations without candidate generation based on the utility-list structures. The enumeration tree and the relationships between 2-itemsets are also adopted in the proposed algorithm to speed up computations. Several experiments are conducted to show the performance of the proposed algorithm in terms of runtime, and memory consumption.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Frequent itemset mining dataset repository (2012), http://fimi.ua.ac.be/data/

  2. Abdullah, Z., Herawan, T., Deris, M.: Mining Significant Least Association Rules using Fast SLP-growth Algorithm. In: Kim, T.-h., Adeli, H. (eds.) AST/UCMA/ISA/ACN 2010. LNCS, vol. 6059, pp. 324–336. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Agrawal, R., Imielinski, T., Swami, A.: Database Mining: A Performance Perspective. IEEE Transactions on Knowledge and Data Engineering 5, 914–925 (1993)

    Article  Google Scholar 

  4. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: The International Conference on Very Large Data Bases, pp. 487–499 (1994)

    Google Scholar 

  5. Agrawal, R., Srikant, R.: Quest synthetic data generator (1994), http://www.Almaden.ibm.com/cs/quest/syndata.html

  6. Ahmed, C.F., Tanbeer, S.K., Jeong, B.S., Lee, Y.K.: Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases. IEEE Transactions on Knowledge and Data Engineering 21, 1708–1721 (2009)

    Article  Google Scholar 

  7. Chan, R., Yang, Q., Shen, Y.D.: Mining high utility itemsets. In: IEEE International Conference on Data Mining, pp. 19–26 (2003)

    Google Scholar 

  8. Chen, M.S., Han, J., Yu, P.S.: Data Mining: An Overview from a Database Perspective. IEEE Transactions on Knowledge and Data Engineering 8, 866–883 (1996)

    Article  Google Scholar 

  9. Cheung, D.W., Han, J., Ng, V., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: International Conference on Data Engineering, pp. 106–114 (1996)

    Google Scholar 

  10. Fournier-Viger, P., Wu, C.W., Zida, S., Tseng, V.S.: FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-Occurrence Pruning. Foundations of Intelligent Systems 8502, 83–92 (2014)

    Google Scholar 

  11. Hong, T.P., Lin, C.W., Wu, Y.L.: Incrementally Fast Updated Frequent Pattern Trees. Expert Systems with Applications 34, 2424–2435 (2008)

    Article  Google Scholar 

  12. Lin, C.W., Hong, T.P., Lu, W.H.: An Effective Tree Structure for Mining High Utility Itemsets. Expert Systems with Applications 38, 7419–7424 (2011)

    Article  Google Scholar 

  13. Lin, C.W., Lan, G.C., Hong, T.P.: An Incremental Mining Algorithm for High Utility Itemsets. Expert Systems with Applications 39, 7173–7180 (2012)

    Article  Google Scholar 

  14. Lin, C.W., Hong, T.P., Lan, G.C., Wong, J.W., Lin, W.Y.: Incrementally Mining High Utility Patterns based on Pre-large Concept. Applied Intelligence 40, 343–357 (2014)

    Article  Google Scholar 

  15. Liu, M., Qu, J.: Mining High Utility Iitemsets without Candidate Generation. In: ACM International Conference on Information and Knowledge Management, pp. 55–64 (2012)

    Google Scholar 

  16. Liu, Y., Liao, W.K., Choudhary, A.: A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689–695. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Nath, B., Bhattacharyya, D.K., Ghosh, A.: Incremental Association Rule Mining: A Survey. WIREs Data Mining Knowledge Discovery 3, 157–169 (2013)

    Article  Google Scholar 

  18. Tseng, V.S., Shie, B.E., Wu, C.W., Yu, P.S.: Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases. IEEE Transactions on Knowledge and Data Engineering 25, 1772–1786 (2013)

    Article  Google Scholar 

  19. Wu, C.W., Shie, B.E., Yu, P.S., Tseng, V.S.: Mining Top-k High Utility Itemsets. In: ACM International Conference on Knowledge Discovery and Data Mining, pp. 12–16 (2012)

    Google Scholar 

  20. Yao, H., Hamilton, H.J.: Mining Itemset Utilities from Transaction Databases. Data & Knowledge Engineering 59, 603–626 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Innovative Information Industry Research Center (IIIRC), China

    Jerry Chun-Wei Lin, Wensheng Gan & Jeng-Shyang Pan

  2. Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, HIT Campus Shenzhen University Town, Xili, Shenzhen, P.R. China

    Jerry Chun-Wei Lin & Jeng-Shyang Pan

  3. Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan, R.O.C.

    Tzung-Pei Hong

  4. Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan, R.O.C.

    Tzung-Pei Hong

Authors
  1. Jerry Chun-Wei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wensheng Gan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tzung-Pei Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jeng-Shyang Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sun Yat-sen University, Guangzhou, P.R. China

    Xudong Luo

  2. The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

    Jeffrey Xu Yu

  3. Guanxi Normal University, Guilin, P.R. China

    Zhi Li

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Lin, J.CW., Gan, W., Hong, TP., Pan, JS. (2014). Incrementally Updating High-Utility Itemsets with Transaction Insertion. In: Luo, X., Yu, J.X., Li, Z. (eds) Advanced Data Mining and Applications. ADMA 2014. Lecture Notes in Computer Science(), vol 8933. Springer, Cham. https://doi.org/10.1007/978-3-319-14717-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14717-8_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14716-1

  • Online ISBN: 978-3-319-14717-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics