Skip to main content

Mining Trending High Utility Itemsets from Temporal Transaction Databases

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11030))

Included in the following conference series:

Abstract

In this paper, we address a novel and important topic in the area of HUI mining, named Trending High Utility Itemset (TrendHUI) mining, with the promise of expanding the applications of HUI mining with the power of trend analytics. We introduce formal definitions for TrendHUI mining and highlighted the importance of the TrendHUI output. Moreover, we develop two algorithms, Two-Phase Trending High Utility Itemset (TP-THUI) miner and Two-Phase Trending High Utility Itemset Guided (TP-THUI-Guided) miner. Both are two-phase algorithms that mine a complete set of TrendHUI. TP-THUI-Guided miner utilizes a remainder utility to calculate the temporal trend of a given itemset to reduce the search space effectively, such that the execution efficiency can be enhanced substantially. Through a series of experiments, using three different datasets, the proposed algorithms prove to be excellent for validity and efficiency. To the best of our knowledge, this is the first work addressing the promising topic on Trending High Utility Itemset mining, which is expected to facilitate numerous applications in data mining fields.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Chan, R., Yang, Q., Shen, Y.D.: Mining high utility itemsets. In: Third IEEE International Conference on Data Mining, ICDM 2003, pp. 19–26. IEEE (2003)

    Google Scholar 

  2. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, pp. 207–216. ACM (1993)

    Google Scholar 

  3. Liu, Y., Liao, W.K., Choudhary, A.: A fast high utility itemsets mining algorithm. In: Proceedings of the 1st International Workshop on Utility-Based Data Mining, pp. 90–99. ACM (2005)

    Google Scholar 

  4. Zida, S., Fournier-Viger, P., Lin, J.C.W., Wu, C.W., Tseng, V.S.: EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl. Inf. Syst. 51(2), 595–625 (2017)

    Article  Google Scholar 

  5. Erwin, A., Gopalan, R.P., Achuthan, N.: CTU-Mine: an efficient high utility itemset mining algorithm using the pattern growth approach. In: 7th IEEE International Conference on Computer and Information Technology, CIT 2007, pp. 71–76. IEEE (2007)

    Google Scholar 

  6. Tseng, V.S., Shie, B.E., Wu, C.W., Philip, S.Y.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)

    Article  Google Scholar 

  7. Song, W., Liu, Y., Li, J.: BAHUI: fast and memory efficient mining of high utility itemsets based on bitmap. Int. J. Data Warehous. Min. (IJDWM) 10(1), 1–15 (2014)

    Article  Google Scholar 

  8. Liu, J., Wang, K., Fung, B.C.: Direct discovery of high utility itemsets without candidate generation. In: 2012 IEEE 12th International Conference on Data Mining (ICDM), pp. 984–989. IEEE (2012)

    Google Scholar 

  9. Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 55–64. ACM (2012)

    Google Scholar 

  10. Krishnamoorthy, S.: Pruning strategies for mining high utility itemsets. Expert Syst. Appl. 42(5), 2371–2381 (2015)

    Article  Google Scholar 

  11. Shie, B.E., Philip, S.Y., Tseng, V.S.: Efficient algorithms for mining maximal high utility itemsets from data streams with different models. Expert Syst. Appl. 39(17), 12947–12960 (2012)

    Article  Google Scholar 

  12. Manike, C., Om, H.: Time-fading based high utility pattern mining from uncertain data streams. In: Kumar Kundu, M., Mohapatra, D.P., Konar, A., Chakraborty, A. (eds.) Advanced Computing, Networking and Informatics-Volume 1. SIST, vol. 27, pp. 529–536. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07353-8_61

    Chapter  Google Scholar 

Download references

Acknowledgements

This research was partially supported by Ministry of Science and Technology, Taiwan, under grant no. MOST 106-3114-E-009-008 and MOST 104-2221-E-009-128-MY3.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vincent S. Tseng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hackman, A., Huang, Y., Tseng, V.S. (2018). Mining Trending High Utility Itemsets from Temporal Transaction Databases. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2018. Lecture Notes in Computer Science(), vol 11030. Springer, Cham. https://doi.org/10.1007/978-3-319-98812-2_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98812-2_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98811-5

  • Online ISBN: 978-3-319-98812-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics