Skip to main content
SpringerLink
Log in
Book cover

International Conference on Intelligent Information Hiding and Multimedia Signal Processing

IIH-MSP 2017: Advances in Intelligent Information Hiding and Multimedia Signal Processing pp 198–205Cite as

Efficient Mining of High Average-Utility Itemsets with Multiple Thresholds

  • Conference paper
  • First Online:

  • 1096 Accesses

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

Abstract

In this paper, we propose an efficient algorithm to discover HAUIs based on the compact average-utility list structure. A tighter upper-bound model is used to instead of the traditional auub model used in HAUIM to lower the upper-bound value. Three pruning strategies are also respectively developed to facilitate mining performance of HAUIM. Experiments show that the proposed algorithm outperforms the state-of-the-art HAUIM-MMAU algorithm in terms of runtime and memory usage.

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

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 EPUB and 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

Learn about institutional subscriptions

References

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

    Google Scholar 

  2. Ahmed, C.F., Tanbeer, S.K., Jeong, B.S., Lee, Y.K.: Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans. Knowl. Data Eng. 21(12), 1708–1721 (2009)

    Article  Google Scholar 

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

    Google Scholar 

  4. Fournier-Viger, P., Lin, J.C.W., Gomariz, A., Gueniche, T., Soltani, A., Deng, Z., Lam, H.T.: The SPMF open-source data mining library version 2. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 36–40 (2016)

    Google Scholar 

  5. Fournier-Viger, P., Lin, J.C.W., Kiran, R.U., Koh, Y.S., Thomas, R.: A survey of sequential pattern mining. Data Sci. Pattern Recogn. 1(1), 54–77 (2017)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  9. Liu, J., Wang, K., Fung, B.C.M.: Mining high utility patterns in one phase without generating candidates. IEEE Trans. Knowl. Data Eng. 28(5), 1245–1257 (2016)

    Article  Google Scholar 

  10. Lin, J.C.W., Gan, W., Fournier-viger, P., Hong, T.P., Zhang, J.: Efficient mining of high-utility itemsets using multiple minimum utility thresholds. Knowl.-Based Syst. 113, 100–115 (2016)

    Article  Google Scholar 

  11. Lin, J.C.W., Li, T., Fournier-Viger, P., Hong, T.P., Su, J.H.: Efficient mining of high average-utility itemsets with multiple minimum thresholds. In: Industrial Conference on Data Mining, vol. 9728, pp. 14–28 (2016)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Acknowledgments

This research was partially supported by the National Natural Science Foundation of China (NSFC) under grant No. 61503092, by the Research on the Technical Platform of Rural Cultural Tourism Planning Basing on Digital Media under grant 2017A020220011, and by the Tencent Project under grant CCF-Tencent IAGR20160115.

Author information

Authors and Affiliations

  1. Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fujian University of Technology, Fuzhou, 350118, China

    Tsu-Yang Wu

  2. National Demonstration Center for Experimental Electronic Information and Electrical Technology Education, Fujian University of Technology, Fuzhou, China

    Tsu-Yang Wu

  3. School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China

    Jerry Chun-Wei Lin & Shifeng Ren

Authors
  1. Tsu-Yang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jerry Chun-Wei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shifeng Ren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jerry Chun-Wei Lin .

Editor information

Editors and Affiliations

  1. Fujian Provincial Key Lab of Big Data Mining and Applications, Fujian University of Technology , Fuzhou, Fujian, China

    Jeng-Shyang Pan

  2. Swinburne University of Technology, Hawthorn, Victoria, Australia

    Pei-Wei Tsai

  3. Universiti Teknologi Petronas, Teronoh, Malaysia

    Junzo Watada

  4. University of Canberra, Bruce, Aust Capital Terr, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Wu, TY., Lin, J.CW., Ren, S. (2018). Efficient Mining of High Average-Utility Itemsets with Multiple Thresholds. In: Pan, JS., Tsai, PW., Watada, J., Jain, L. (eds) Advances in Intelligent Information Hiding and Multimedia Signal Processing. IIH-MSP 2017. Smart Innovation, Systems and Technologies, vol 81. Springer, Cham. https://doi.org/10.1007/978-3-319-63856-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63856-0_25

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation