IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v8y2017i1p45-60.html
   My bibliography  Save this article

Scalable Differential Evolutionary Clustering Algorithm for Big Data Using Map-Reduce Paradigm

Author

Listed:
  • Zakaria Benmounah

    (Computer Science Department, University of Constantine 2, Constantine, Algeria)

  • Souham Meshoul

    (Computer Science Department, University of Constantine 2, Constantine, Algeria)

  • Mohamed Batouche

    (Computer Science Department, University of Constantine 2, Constantine, Algeria)

Abstract

One of the remarkable results of the rapid advances in information technology is the production of tremendous amounts of data sets, so large or complex that available processing methods are inadequate, among these methods cluster analysis. Clustering becomes more challenging and complex. In this paper, the authors describe a highly scalable Differential Evolution (DE) algorithm based on map-reduce programming model. The traditional use of DE to deal with clustering of large sets of data is so time-consuming that it is not feasible. On the other hand, map-reduce is a programming model emerged lately to allow the design of parallel and distributed approaches. In this paper, four stages map-reduce differential evolution algorithm termed as DE-MRC is presented; each of these four phases is a map-reduce process and dedicated to a particular DE operation. DE-MRC has been tested on a real parallel platform of 128 computers connected with each other and more than 30 GB of data. Experimental results show the high scalability and robustness of DE-MRC.

Suggested Citation

  • Zakaria Benmounah & Souham Meshoul & Mohamed Batouche, 2017. "Scalable Differential Evolutionary Clustering Algorithm for Big Data Using Map-Reduce Paradigm," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 8(1), pages 45-60, January.
    • Handle: RePEc:igg:jamc00:v:8:y:2017:i:1:p:45-60
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2017010103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:8:y:2017:i:1:p:45-60. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.