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

Gene Clustering Using Metaheuristic Optimization Algorithms

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, Mallasamudram, India)

Abstract

Gene clustering is a familiar step in the exploratory analysis of high dimensional biological data. It is the process of grouping genes of similar patterns in the same cluster and aims at analyzing the functions of gene that leads to the development of drugs and early diagnosis of diseases. In the recent years, much research has been proposed using nature inspired meta-heuristic algorithms. Cuckoo Search is one such optimization algorithm inspired from nature by breeding strategy of parasitic bird, the cuckoo. This paper proposes cuckoo search clustering and clustering using levy flight cuckoo search for grouping brain tumor gene expression dataset. A comparative study is made with genetic algorithm, PSO clustering, cuckoo search clustering and clustering using levy flight cuckoo search. Levy flight is an important property of levy distribution which covers the entire search space. Breeding pattern of cuckoo is associated with the genes that cause tumor to grow and affect other organs gradually. Clusters generated by these algorithms are validated to find the closeness among the genes in a cluster and separation of genes between clusters. Experimental results carried out in this paper show that cuckoo search clustering outperforms other clustering methods used for experimentation.

Suggested Citation

  • P. K. Nizar Banu & S. Andrews, 2015. "Gene Clustering Using Metaheuristic Optimization Algorithms," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 6(4), pages 14-38, October.
  • Handle: RePEc:igg:jamc00:v:6:y:2015:i:4:p:14-38
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2015100102
    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:6:y:2015:i:4:p:14-38. 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.