An Hybrid Multi-Core/GPU-Based Mimetic Algorithm for Big Association Rule Mining | SpringerLink
Skip to main content

An Hybrid Multi-Core/GPU-Based Mimetic Algorithm for Big Association Rule Mining

  • Conference paper
  • First Online:
Genetic and Evolutionary Computing (ICGEC 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 579))

Included in the following conference series:

Abstract

This paper addresses the problem of big association rule mining using an evolutionary approach. The mimetic method has been successfully applied to small and medium size databases. However, when applied on larger databases, the performance of this method becomes an important issue and current algorithms have very long execution times. Modern CPU/GPU architectures are composed of many cores, which are massively threaded and provide a large amount of computing power, suitable for improving the performance of optimization techniques. The parallelization of such method on GPU architecture is thus promising to deal with very large datasets in real time. In this paper, an approach is proposed where the rule evaluation process is parallelized on GPU, while the generation of rules is performed on a multi-core CPU. Furthermore, an intelligent strategy is proposed to partition the search space of rules in several independent sub-spaces to allow multiple CPU cores to explore the search space efficiently and without performing redundant work. Experimental results reveal that the suggested approach outperforms the sequential version by up to at 600 times for large datasets. Moreover, it outperforms the-state-of-the-art high performance computing based approaches when dealing with the big WebDocs dataset.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 17159
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 21449
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

Notes

  1. 1.

    http://fimi.ua.ac.be/data.

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Rec. 22(2), 207–216 (1993). ACM

    Google Scholar 

  2. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Rec. 29(2), 1–12 (2000). ACM

    Google Scholar 

  3. Gheraibia, Y., Moussaoui, A., Djenouri, Y., Kabir, S., Yin, P.Y.: Penguins search optimisation algorithm for association rules mining. J. Comput. Inf. Technol. CIT 24(2), 165–179 (2016)

    Article  Google Scholar 

  4. Djenouri, Y., Drias, H., Habbas, Z.: Bees swarm optimisation using multiple strategies for association rule mining. Int. J. Bio-Inspired Comput. 6(4), 239–249 (2014)

    Article  Google Scholar 

  5. Mata, J., Alvarez, J.L., Riquelme, J.C.: An evolutionary algorithm to discover numeric association rules. In: Proceedings of the 2002 ACM Symposium on Applied Computing, pp. 590–594. ACM (2002)

    Google Scholar 

  6. Djenouri, Y., Bendjoudi, A., Nouali-Taboudjemat, N., Habbas, Z.: An improved evolutionary approach for association rules mining. In: Bio-Inspired Computing-Theories and Applications, pp. 93–97. Springer, Heidelberg (2014)

    Google Scholar 

  7. Silvestri, C., Orlando, S.: GPUDCI: exploiting GPUS in frequent itemset mining. In: 2012 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 416–425. IEEE (2012)

    Google Scholar 

  8. Djenouri, Y., Bendjoudi, A., Habbas, Z., Mehdi, M., Djenouri, D.: Reducing thread divergence in GPU-based bees swarm optimization applied to association rule mining. Concurrency Comput. Pract. Exp. 29(9) (2017)

    Google Scholar 

  9. Chen, Y., Li, F., Fan, J.: Mining association rules in big data with NGEP. Cluster Comput. 18(2), 577–585 (2015)

    Article  Google Scholar 

  10. Yoo, J.S., Boulware, D., Kimmey, D.: Incremental and Parallel Association Mining for Evolving Spatial Data: A Less Iterative Approach on MapReduce (2015)

    Google Scholar 

  11. Djenouri, Y., Bendjoudi, A., Djenouri, D., Habbas, Z.: Parallel BSO algorithm for association rules mining using master/worker paradigm. In: International Conference on Parallel Processing and Applied Mathematics, pp. 258–268. Springer International Publishing (2015)

    Google Scholar 

  12. Djenouri, Y., Bendjoudi, A., Djenouri, D., Comuzzi, M.: GPU-based bio-inspired model for solving association rules mining problem. In: 2017 25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 262–269. IEEE (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Youcef Djenouri .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Djenouri, Y., Belhadi, A., Fournier-Viger, P., Lin, J.CW. (2018). An Hybrid Multi-Core/GPU-Based Mimetic Algorithm for Big Association Rule Mining. In: Lin, JW., Pan, JS., Chu, SC., Chen, CM. (eds) Genetic and Evolutionary Computing. ICGEC 2017. Advances in Intelligent Systems and Computing, vol 579. Springer, Singapore. https://doi.org/10.1007/978-981-10-6487-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6487-6_8

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6486-9

  • Online ISBN: 978-981-10-6487-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics