Skip to main content

Association Rule Mining Based on Bat Algorithm

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 472))

Abstract

In this paper, we propose a bat-based algorithm (BA) for association rule mining (ARM Bat). Our algorithm aims to maximize the fitness function to generate the best rules in the defined dataset starting from a specific minimum support and minimum confidence. The efficiency of our proposed algorithm is tested on several generic datasets with different number of transactions and items. The results are compared to FPgrowth algorithm results on the same datasets. ARM bat algorithm perform better than the FPgrowth algorithm in term of computation speed and memory usage,

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, pp. 207–216. ACM (1993)

    Google Scholar 

  2. Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, vol. 1215, pp. 487–499 (1994)

    Google Scholar 

  3. Ankita, S., Shikha, A., Jitendra, A., Sanjeev, S.: A review on application of particle swarm optimization in association rule mining. In: Satapathy, S.C., Udgata, S.K., Biswal, B.N. (eds.) Proc. of Int. Conf. on Front. of Intell. Comput. AISC, vol. 199, pp. 405–414. Springer, Heidelberg (2013)

    Google Scholar 

  4. Djenouri, Y., Drias, H., Habbas, Z., Mosteghanemi, H.: Bees swarm optimization for web association rule mining. In: 2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology (WI-IAT), vol. 3, pp. 142–146. IEEE (2012)

    Google Scholar 

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

    Google Scholar 

  6. Kuo, R.J., Chao, C.M., Chiu, Y.T.: Application of particle swarm optimization to association rule mining. Applied Soft Computing 11(1), 326–336 (2011)

    Article  Google Scholar 

  7. Yan, X., Zhang, C., Zhang, S.: Genetic algorithm-based strategy for identifying association rules without specifying actual minimum support. Expert Systems with Applications 36(2), 3066–3076 (2009)

    Article  Google Scholar 

  8. Yang, X.-S.: A new metaheuristic bat-inspired algorithm. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) NICSO 2010. SCI, vol. 284, pp. 65–74. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heraguemi, K.E., Kamel, N., Drias, H. (2014). Association Rule Mining Based on Bat Algorithm. In: Pan, L., Păun, G., Pérez-Jiménez, M.J., Song, T. (eds) Bio-Inspired Computing - Theories and Applications. Communications in Computer and Information Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45049-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45049-9_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45048-2

  • Online ISBN: 978-3-662-45049-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics