Skip to main content

A New Parallel Memetic Algorithm to Knowledge Discovery in Data Mining

  • Conference paper
  • First Online:
Swarm Intelligence Based Optimization (ICSIBO 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10103))

Included in the following conference series:

  • 456 Accesses

Abstract

This paper presents a new parallel memetic algorithm (PMA) for solving the problem of classification in the process of Data Mining. We focus our interest on accelerating the PMA. In most parallel algorithms, the tasks performed by different processors need access to shared data, this creates a need for communication, which in turn slows the performance of the PMA. In this work, we will present the design of our PMA, In which we will use a new replacement approach, which is a hybrid approach that uses both Lamarckian and Baldwinian approaches at the same time, to reduce the quantity of informations exchanged between processors and consequently to improve the speedup of the PMA. An extensive experimental study performed on the UCI Benchmarks proves the efficiency of our PMA. Also, we present the speedup analysis of the PMA.

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 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

References

  1. Cios, K.J., Pedryecz, W., Swinniarsky, R.W., Kurgan, A., et al.: Data Mining: A Knowledge Discovery Approach. Editions Springer Science (2007)

    Google Scholar 

  2. Jain, A.K., Dubes, R.C.: Algorithms for clustering data. Editions Prentice Hall Advanced Reference Series. Prentice Hall, New Jersey (1988)

    Google Scholar 

  3. Dréo, J., Pétrowski, A., Siarry, P., Taillard, E.: Métaheuristiques pour l’optimisation difficile. Eyrolles (2005)

    Google Scholar 

  4. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)

    Google Scholar 

  5. Hao, J.-K., Galinier, P., Habib, M.: Métaheuristiques pour l’optimisation combinatoire et l’affectation sous contraintes. Revue d’intelligence artificielle (1999)

    Google Scholar 

  6. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Massachusetts (1989)

    MATH  Google Scholar 

  7. Glover, F.: Tabu search - Part I. ORSA J. Comput. 1(3), 190–206 (1989)

    Google Scholar 

  8. Crainic, T.G., Toulouse, M., et al.: Parallel Metaheuristics. In: Crainic, T.G.¸ Laporte, G. (eds.) Fleet Management and Logistics, pp. 205–251. Kluwer Academic, Norwell (1998)

    Google Scholar 

  9. Cantú-Paz, E.: A survey of parallel genetic algorithms. Calculateurs parallèles, réseaux et systèmes répartis 10(2), 141–171 (1998)

    Google Scholar 

  10. Bachelet, V., Hafidi, Z., Preux, P., Talbi, E.-G.: Vers la coopération des métaheuristiques. Calculateurs parallèles, réseaux et systèmes répartis 10(2) (1998)

    Google Scholar 

  11. Alba, E., Luque, G.: IV leasuring the performance of parallel metaheuristics. In: Parallel Metaheuristics: A new Class of Algorithms. Wiley-Interscience (2005)

    Google Scholar 

  12. Barr, R., Hickman, B.: Reporting Computational Experiments with ParaUel Algorithms: Issues, Measures, and Experts’ Opinions. Dept. of Computer Science and Engineering, Southern Tvlethodist University (1992)

    Google Scholar 

  13. Malony, A.: Tools for Parallel Computing: A Performance Evaluation Perspective, ch. VII, p. 342. Springer (2000)

    Google Scholar 

  14. Bacardit, J.: Pittsburgh Genetic-Based Machine Learning in the Data Mining era: Representations, Generalization, and Run-time. Ph.d. Thesis, Universitat Ramon LIul, Spain (2004)

    Google Scholar 

  15. Witten, I.H.: Data Mining: Practical Machine Learning Tools and Techniques with JAVA Implementations. Morgan Kaufman Publishers, San Mateo (2003)

    Google Scholar 

  16. Tan, K.C., Yu, Q., Ang, J.H.: A dual-objective evolutionary algorithm for rules extraction in data mining. Comput. Optim. Appl. 34, 273–294 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998)

    Google Scholar 

  18. Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech concurrent computation program, C3P Report 826 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dahmri Oualid .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Oualid, D., Baba-Ali, A.R. (2016). A New Parallel Memetic Algorithm to Knowledge Discovery in Data Mining. In: Siarry, P., Idoumghar, L., Lepagnot, J. (eds) Swarm Intelligence Based Optimization. ICSIBO 2016. Lecture Notes in Computer Science(), vol 10103. Springer, Cham. https://doi.org/10.1007/978-3-319-50307-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50307-3_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50306-6

  • Online ISBN: 978-3-319-50307-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics