Skip to main content

Mining High Utility Itemsets in Big Data

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2015)

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

Included in the following conference series:

Abstract

In recent years, extensive studies have been conducted on high utility itemsets (HUI) mining with wide applications. However, most of them assume that data are stored in centralized databases with a single machine performing the mining tasks. Consequently, existing algorithms cannot be applied to the big data environments, where data are often distributed and too large to be dealt with by a single machine. To address this issue, we propose a new framework for mining high utility itemsets in big data. A novel algorithm named PHUI-Growth (Parallel mining High Utility Itemsets by pattern-Growth) is proposed for parallel mining HUIs on Hadoop platform, which inherits several nice properties of Hadoop, including easy deployment, fault recovery, low communication overheads and high scalability. Moreover, it adopts the MapReduce architecture to partition the whole mining tasks into smaller independent subtasks and uses Hadoop distributed file system to manage distributed data so that it allows to parallel discover HUIs from distributed data across multiple commodity computers in a reliable, fault tolerance manner. Experimental results on both synthetic and real datasets show that PHUI-Growth has high performance on large-scale datasets and outperforms state-of-the-art non-parallel type of HUI mining algorithms.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: A fast algorithms for mining association rules. In: Proceedings of VLDB, 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. Bifet, A., Holmes, G., Kirkby, R., Pfahringer, B.: MOA: Massive Online Analysis. JMLR (2010). http://moa.cms.waikato.ac.nz/

  4. Fan, W., Bifet, A.: Mining Big Data: Current Status, and Forecast to the Future. SIGKDD Explorations 14(2), 1–5 (2012)

    Article  Google Scholar 

  5. Han, J., Pei, J., Yin., Y.: Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD, pp. 1–12 (2000)

    Google Scholar 

  6. Liu, Y., Liao, W., Choudhary, A.: Fast high-utility itemsets mining algorithm. In: Proceedings of UBDM (2005)

    Google Scholar 

  7. Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of CIKM, pp. 55–64 (2012)

    Google Scholar 

  8. Liu, J., Wang, K., Fung, B.C.M.: Direct discovery of high utility itemsets without candidate generation. In: Proceedings of IEEE ICDM, pp. 984–989 (2012)

    Google Scholar 

  9. Li, Y.-C., Yeh, J.-S., Chang, C.-C.: Isolated Items Discarding Strategy for Discovering High-utility Itemsets. DKE 64(1), 198–217 (2008)

    Article  Google Scholar 

  10. Pisharath, J., Liu, Y., Ozisikyilmaz, B., Narayanan, R., Liao, W.K., Choudhary, A., Memik, G.: NU-MineBench version 2.0 dataset and technical report

    Google Scholar 

  11. Subramanian, K., Kandhasamy, P., Subramanian, S.: A Novel Approach to Extract High Utility Itemsets from Distributed Databases. Computing and Informatics 31, 1597–1615 (2012)

    Google Scholar 

  12. Tseng, V.S., Shie, B.-E., Wu, C.-W., Yu, P.S.: Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)

    Article  Google Scholar 

  13. Vo, B., Nguyen, H., Ho, T.B., Le, B.: Parallel method for mining high utility itemsets from vertically partitioned distributed databases. In: Velásquez, J.D., Rios, S.A., Howlett, R.J., Jain, L.C. (eds.) KES 2009, Part I. LNCS, vol. 5711, pp. 251–260. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Apache Hadoop. http://hadoop.apache.org

  15. Frequent itemset mining implementations repository. http://fimi.cs.helsinki.fi/

  16. Microsoft Corporation: Example database FoodMart of Microsoft SQL Server Analysis Server

    Google Scholar 

  17. SAMOA. http://samoa-project.net

  18. Vowpal Wabbit. http://hunch.net/Ëœvw/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ying Chun Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lin, Y.C., Wu, CW., Tseng, V.S. (2015). Mining High Utility Itemsets in Big Data. In: Cao, T., Lim, EP., Zhou, ZH., Ho, TB., Cheung, D., Motoda, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2015. Lecture Notes in Computer Science(), vol 9078. Springer, Cham. https://doi.org/10.1007/978-3-319-18032-8_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18032-8_51

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics