Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Model Order Reduction Adapted to Steel Beams Filled with a Composite Material Read chapter Read first chapter

2019 | OriginalPaper | Chapter

A Parallel Algorithm for Mining High Utility Itemsets

Authors : Trinh D. D. Nguyen, Loan T. T. Nguyen, Bay Vo

Published in: Information Systems Architecture and Technology: Proceedings of 39th International Conference on Information Systems Architecture and Technology – ISAT 2018

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

High utility itemset mining (HUIM) is a popular and important mining task in recent years. The problem is considered computational expensive in terms of execution time and memory consumption. Many algorithms have been proposed to solve this problem efficiently. In this paper, we propose a parallel approach for mining HUIs, which utilizes the modern multi-core processors by splitting the search space in to disjointed sub-spaces, assign them to the processor cores and explore them in parallel. Experimental results show that the proposed algorithm outperformed the original state-of-the-art HUIM algorithm EFIM in terms of execution times and have comparable memory usage.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Big Data Approach to Analyzing Job Portals for the ICT Market
next chapter Use of the EPSILON Decomposition and the SVD Based LSI Techniques for Reduction of the Large Indexing Structures
Literature
1.
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994 Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499 (1994)
2.
Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: 3rd SIAM International Conference on Data Mining, pp. 482–486 (2004)
3.
Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: 21st International Symposium on Methodologies of Intelligent Systems, pp. 83–92 (2014)
4.
Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: 21st ACM International Conference on Information and Knowledge Management, pp. 55–64 (2012)
5.
Tseng, V.S., Shie, B.-E., Cheng-Wei, W., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)CrossRef
6.
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000 Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas, pp. 1–12 (2000)
7.
Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. Data Knowl. Eng. 59(3), 603–626 (2006)CrossRef
8.
Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 689–695 (2005)
9.
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)CrossRef
10.
Tseng, V.S., Wu, C.-W., Shie, B.-E., Yu, P.S.: UP-Growth: an efficient algorithm for high utility itemset mining. In: 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 253–262 (2010)
11.
Solihin, Y.: Fundamentals of Parallel Computer Architecture. CRC Press, Boca Raton (2009)
12.
Le, B., Nguyen, H., Cao, T.A., Vo, B.: A novel algorithm for mining high utility itemsets. In: 1st Intelligent Information and Database Systems, pp. 13–17 (2009)
13.
Le, B., Nguyen, H., Vo, B.: An efficient strategy for mining high utility itemsets. Int. J. Intell. Inf. Database Syst. 5(2), 164–176 (2011)
14.
Krishnamoorthy, S.: Pruning strategies for mining high utility itemsets. Expert Syst. Appl. Int. J. 42(5), 2371–2381 (2015)CrossRef
15.
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)CrossRef
16.
Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Mach. Learn. 42, 31–60 (2010)CrossRef
17.
Cong, S., Han, J., Padua, D.: Parallel mining of closed sequential pattern. In: Proceedings of ACM SIGKDD, vol. 5, pp. 562–567 (2005)
18.
Chen, Y., An, A.: Approximate parallel high utility itemset mining. Big Data Res. 6, 26–42 (2016)CrossRef
19.
Zaki, M.J.: Parallel and distributed association mining: a survey. IEEE Concurr. 7(4), 14–25 (1999)CrossRef
20.
Fournier-Viger, P., et al.: SPMF: a Java open-source pattern mining library. J. Mach. Learn. Res. 15(1), 3389–3393 (2014)MATH
Metadata
Title
A Parallel Algorithm for Mining High Utility Itemsets
Authors
Trinh D. D. Nguyen
Loan T. T. Nguyen
Bay Vo
Copyright Year
2019
Book
Information Systems Architecture and Technology: Proceedings of 39th International Conference on Information Systems Architecture and Technology – ISAT 2018

Print ISBN: 978-3-319-99995-1

Electronic ISBN: 978-3-319-99996-8

Copyright Year: 2019

DOI
https://doi.org/10.1007/978-3-319-99996-8_26

Premium Partner

    Image Credits