IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v10y2019i2p48-59.html
   My bibliography  Save this article

Global Artificial Bee Colony Search Algorithm for Data Clustering

Author

Listed:
  • Zeeshan Danish

    (University of Malakand, Charsadda, Pakistan)

  • Habib Shah

    (King Khalid University, Abha, Saudi Arabia)

  • Nasser Tairan

    (King Khalid University, Abha, Saudi Arabia)

  • Rozaida Gazali

    (Universiti Tun Hussein Onn Malaysia, Malaysia)

  • Akhtar Badshah

    (Department of Software Engineering, University of Malakand, Pakistan)

Abstract

Data clustering is a widespread data compression, vector quantization, data analysis, and data mining technique. In this work, a modified form of ABC, i.e. global artificial bee colony search algorithm (GABCS) is applied to data clustering. In GABCS the modification is due to the fact that experienced bees can use past information of quantity of food and position to adjust their movements in a search space. Due to this fact, solution search equations of the canonical ABC are modified in GABCS and applied to three famous real datasets in this work i.e. iris, thyroid, wine, accessed from the UCI database for the purpose of data clustering and results were compared with few other stated algorithms such as K-NM-PSO, TS, ACO, GA, SA and ABC. The results show that while calculating intra-clustering distances and computation time on all three real datasets, the proposed GABCS algorithm gives far better performance than other algorithms whereas calculating computation numbers it performs adequately as compared to typical ABC.

Suggested Citation

  • Zeeshan Danish & Habib Shah & Nasser Tairan & Rozaida Gazali & Akhtar Badshah, 2019. "Global Artificial Bee Colony Search Algorithm for Data Clustering," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 10(2), pages 48-59, April.
  • Handle: RePEc:igg:jsir00:v:10:y:2019:i:2:p:48-59
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2019040104
    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:jsir00:v:10:y:2019:i:2:p:48-59. 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.