IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v42y2025i1d10.1007_s00357-024-09486-y.html
   My bibliography  Save this article

An Effective Crow Search Algorithm and Its Application in Data Clustering

Author

Listed:
  • Rajesh Ranjan

    (National Institute of Technology)

  • Jitender Kumar Chhabra

    (National Institute of Technology)

Abstract

In today’s data-centric world, the significance of generated data has increased manifold. Clustering the data into a similar group is one of the dynamic research areas among other data practices. Several algorithms’ proposals exist for clustering. Apart from the traditional algorithms, researchers worldwide have successfully employed some metaheuristic approaches for clustering. The crow search algorithm (CSA) is a recently introduced swarm-based algorithm that imitates the performance of the crow. An effective crow search algorithm (ECSA) has been proposed in the present work, which dynamically attunes its parameter to sustain the search balance and perform an oppositional-based random initialization. The ECSA is evaluated over CEC2019 Benchmark Functions and simulated for data clustering tasks compared with well-known metaheuristic approaches and famous partition-based K-means algorithm over benchmark datasets. The results reveal that the ECSA performs better than other algorithms in the context of external cluster quality metrics and convergence rate.

Suggested Citation

  • Rajesh Ranjan & Jitender Kumar Chhabra, 2025. "An Effective Crow Search Algorithm and Its Application in Data Clustering," Journal of Classification, Springer;The Classification Society, vol. 42(1), pages 134-162, March.
    • Handle: RePEc:spr:jclass:v:42:y:2025:i:1:d:10.1007_s00357-024-09486-y
    DOI: 10.1007/s00357-024-09486-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-024-09486-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00357-024-09486-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jclass:v:42:y:2025:i:1:d:10.1007_s00357-024-09486-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.