Skip to main content

More Efficient Algorithm to Mine High Average-Utility Patterns

  • Conference paper
  • First Online:
Advances in Intelligent Information Hiding and Multimedia Signal Processing

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 64))

Abstract

In this paper, an efficient algorithm with three pruning strategies are presented to provide tighter upper-bound average-utility of the itemsets, thus reducing the search space for mining the set of high average-utility itemsets (HAUIs). The first strategy finds the relationships of the 2-itemsets, thus reducing the search space of k-itemsets (k ≥ 3). The second and the third pruning strategies set lower upper-bounds of the itemsets to early reduce the unpromising candidates. Substantial experiments show that the proposed algorithm can efficiently and effectively reduce the search space compared to the state-of-the-art algorithms in terms of runtime and number of candidates.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R. Srikant: Fast algorithms for mining association rules. International Conference on Very Large Data Bases, pp. 487-499 (1994)

    Google Scholar 

  2. Erwin, A., Gopalan, R. P., Achuthan, N. R.: Efficient mining of high utility itemsets from large datasets. The Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp. 554-561 (2008)

    Google Scholar 

  3. Fournier-Viger, P., Wu, C. W., Zida, S., Tseng, V. S.: FHM: faster high-utility item-set mining using estimated utility co-occurrence pruning. International Symposium on Methodologies for Intelligent Systems, pp. 83-92 (2014)

    Google Scholar 

  4. Frequent itemset mining implementations repository, http://fimi.ua.ac.be/data/ (2016)

  5. Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8, pp. 5387 (2004)

    Google Scholar 

  6. Hong, T. P., Lee, C. H., Wang, S. L.: Effective utility mining with the measure of average utility. Expert Systems with Applications, 38(7), pp. 8259-8265 (2011)

    Google Scholar 

  7. Lan, G. C., Hong, T. P., Tseng, V. S.: Efficiently mining high average-utility itemsets with an improved upper-bound. International Journal of Information Technology and Decision Making, 11(5), pp. 1009-1030 (2012)

    Google Scholar 

  8. Li, Y. C., Yeh, J. S., Chang, C. C.: Isolated items discarding strategy for discovering high utility itemsets. Data and Knowledge Engineering, 64(1), pp. 198-217 (2008)

    Google Scholar 

  9. Lin, C. W., Hong, T. P., Lu, W. H.: Efficiently mining high average utility itemsets with a tree structure. The Asian Conference on Intelligent Information and Database Systems, pp. 131-139 (2010)

    Google Scholar 

  10. Lin, J. C. W., Li, T., Fournier-Viger, P., Hong, T. P., Zhan, J., Voznak, M.: An efficient algorithm to mine high average-utility itemsets. Advanced Engineering Informatics, 30(2), pp. 233243 (2016)

    Google Scholar 

  11. Liu, Y., Liao, W. K., Choudhary, A.: A fast high utility itemsets mining algorithm. The International Workshop on Utility-based Data Mining, pp. 90-99 (2005)

    Google Scholar 

  12. Liu, Y., Liao, W. K., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. Lecture Notes in Computer Science, pp. 689-695 (2005)

    Google Scholar 

  13. Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. ACM International Conference on Information and Knowledge Management, pp. 55-64 (2012)

    Google Scholar 

  14. Lu, T., Vo, B., Nguyen, H. T., Hong, T. P.: A new method for mining high average utility itemsets. Lecture Notes in Computer Science, pp. 33-42 (2014)

    Google Scholar 

  15. Yao, H., Hamilton, H. J., Butz, C. J.: A foundational approach to mining itemset utilities from databases. SIAM International Conference on Data Mining, pp. 482-486 (2004)

    Google Scholar 

  16. Yao, H., Hamilton, H. J., Geng, L.: A unified framework for utility based measures for mining itemsets. The International Workshop on Utility-Based Data Mining, pp. 27-28 (2006)

    Google Scholar 

  17. Yen, S. J., Lee, Y. S.: Mining high utility quantitative association rules. International Conference on Big Data Analytics and Knowledge Discovery, pp. 283-292 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jerry Chun-Wei Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Lin, J.CW., Ren, S., Fournier-Viger, P., Su, JH., Vo, B. (2017). More Efficient Algorithm to Mine High Average-Utility Patterns. In: Pan, JS., Tsai, PW., Huang, HC. (eds) Advances in Intelligent Information Hiding and Multimedia Signal Processing. Smart Innovation, Systems and Technologies, vol 64. Springer, Cham. https://doi.org/10.1007/978-3-319-50212-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50212-0_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50211-3

  • Online ISBN: 978-3-319-50212-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics