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

Harmony Search PSO Clustering for Tumor and Cancer Gene Expression Dataset

Author

Listed:
  • P. K. Nizar Banu

    (Department of Computer Applications, B.S. Abdur Rahman University, Chennai, India)

  • S. Andrews

    (Department of Information Technology, Mahendra Engineering College, Namakkal India, India)

Abstract

Enormous quantity of gene expression data from diverse data sources are accumulated due to the modern advancement in microarray technology that leads to major computational challenges. The foremost step towards addressing this challenge is to cluster genes which reveal hidden gene expression patterns and natural structures to find the interesting patterns from the underlying data that in turn helps in disease diagnosis and drug development. Particle Swarm Optimization (PSO) technique is extensively used for many practical applications but fails in finding the initial seeds to generate clusters and thus reduces the clustering accuracy. One of the meta-heuristic optimization algorithms called Harmony Search is free from divergence and helps to find out the near-global optimal solutions by searching the entire solution space. This paper proposes a novel Harmony Search Particle Swarm Optimization (HSPSO) clustering algorithm and is applied for Brain Tumor, Colon Cancer, Leukemia Cancer and Lung Cancer gene expression datasets for clustering. Experimental results show that the proposed algorithm produces clusters with better compactness and accuracy, in comparison with K-means clustering, PSO clustering (swarm clustering) and Fuzzy PSO clustering.

Suggested Citation

  • P. K. Nizar Banu & S. Andrews, 2014. "Harmony Search PSO Clustering for Tumor and Cancer Gene Expression Dataset," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 5(3), pages 1-21, July.
  • Handle: RePEc:igg:jsir00:v:5:y:2014:i:3:p:1-21
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijsir.2014070101
    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:5:y:2014:i:3:p:1-21. 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.