Skip to main content

Effective Mining of High Utility Itemsets with Automated Minimum Utility Thresholds

  • Conference paper
  • First Online:
Intelligent Computing and Innovation on Data Science

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 118))

  • 910 Accesses

Abstract

Utility mining is the recent data science task in the ground of data mining. Utility mining observes profit and quantity of each distinct item present in the transactions, thus it results in productive patterns with high importance in transactional databases. There are many algorithms sketched to trace the entire set of highly productive utility itemsets using user-defined single minimum utility threshold. An efficient framework called high utility itemset mining with automated minimum utility thresholds (HUIM-AMU) is put forward in this research paper. This algorithm uses a condensed tree arrangement called utility pattern tree to store the transactions and a constant value indicating the amount of most profitable itemsets. With very large count of transactions in a database, it is very difficult to identify the importance or productivity of every item. Without the knowledge of items, threshold setting may degrade the effectiveness of the process. In our proposed work, the difficulty in the setting of minimum threshold and the time spent on the analysis of database to set threshold are reduced by automating the threshold setting process. The results clearly indicate that the HUIM-AMU generates only profitable and compact itemsets.

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 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. Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM Sigmod Rec 29(2):1–12

    Article  Google Scholar 

  2. Hu Y-H, Chen Y-L (2006) Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism. DSS42 (1):1–24

    Google Scholar 

  3. Ahmed CF, Tanbeer SK, Jeong B-S, Lee Y-K (2011) HUC-Prune: an efficient candidate pruning technique to mine high utility patterns. Appl Intell 34(2):181–198

    Article  Google Scholar 

  4. Kiran RU, Reddy PK (2011) Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms. In: Proceedings of the 14th international conference on extending database technology, pp 11–20

    Google Scholar 

  5. Liu Y, Liao WK, Choudhary AN (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Proceedings of the 9th Pacific-Asia conference on knowledge discovery and data mining. Springer, Heidelberg, pp 689–695

    Google Scholar 

  6. Liu M, Qu J (2012) Mining high utility itemsets without Candidate generation. In: Conference on information and knowledge management. Association for Computing Machinery, pp 55– 64

    Google Scholar 

  7. Tseng VS, Wu C-W, Shie B-E, Yu PS (2010) UP-Growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD ICKDDM, pp 253–262

    Google Scholar 

  8. Tseng VS, Shie B-E, Wu C-W, Yu PS (2012) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Know Data Engg 25(8):1772–1786

    Article  Google Scholar 

  9. Lin C-W, Hong T-P, Lu W-H (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38(6):7419–7424

    Google Scholar 

  10. Liu B, Hsu W, Ma Y (1999) Mining association rules with multiple minimum supports. In: Proceedings of the 5th ACM SIGKDD ICKDDM, pp 337–341

    Google Scholar 

  11. Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Zhan J (2017) Mining of frequent patterns with multiple minimum supports. Eng Appl Artif Intell 60:83–96

    Article  Google Scholar 

  12. Lin JCW, Gan W, Fournier-Viger P, Hong T-P (2015) Mining high-utility itemsets with multiple minimum utility thresholds. In: Proceedings of the eighth international conference on computer science & software engineering, pp 9–17

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. Wisely Joe .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wisely Joe, J., Ghinaiya, M., Syed Ibrahim, S.P. (2020). Effective Mining of High Utility Itemsets with Automated Minimum Utility Thresholds. In: Peng, SL., Son, L.H., Suseendran, G., Balaganesh, D. (eds) Intelligent Computing and Innovation on Data Science. Lecture Notes in Networks and Systems, vol 118. Springer, Singapore. https://doi.org/10.1007/978-981-15-3284-9_30

Download citation

Publish with us

Policies and ethics