• DocumentCode
    954180
  • Title

    An evolutionary clustering algorithm for gene expression microarray data analysis

  • Author

    Ma, Patrick C H ; Chan, Keith C C ; Yao, Xin ; Chiu, David K Y

  • Author_Institution
    Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, China
  • Volume
    10
  • Issue
    3
  • fYear
    2006
  • fDate
    6/1/2006 12:00:00 AM
  • Firstpage
    296
  • Lastpage
    314
  • Abstract
    Clustering is concerned with the discovery of interesting groupings of records in a database. Many algorithms have been developed to tackle clustering problems in a variety of application domains. In particular, some of them have been used in bioinformatics research to uncover inherent clusters in gene expression microarray data. In this paper, we show how some popular clustering algorithms have been used for this purpose. Based on experiments using simulated and real data, we also show that the performance of these algorithms can be further improved. For more effective clustering of gene expression microarray data, which is typically characterized by a lot of noise, we propose a novel evolutionary algorithm called evolutionary clustering (EvoCluster). EvoCluster encodes an entire cluster grouping in a chromosome so that each gene in the chromosome encodes one cluster. Based on such encoding scheme, it makes use of a set of reproduction operators to facilitate the exchange of grouping information between chromosomes. The fitness function that the EvoCluster adopts is able to differentiate between how relevant a feature value is in determining a particular cluster grouping. As such, instead of just local pairwise distances, it also takes into consideration how clusters are arranged globally. Unlike many popular clustering algorithms, EvoCluster does not require the number of clusters to be decided in advance. Also, patterns hidden in each cluster can be explicitly revealed and presented for easy interpretation even by casual users. For performance evaluation, we have tested EvoCluster using both simulated and real data. Experimental results show that it can be very effective and robust even in the presence of noise and missing values. Also, when correlating the gene expression microarray data with DNA sequences, we were able to uncover significant biological binding sites (both previously known and unknown) in each cluster discovered by EvoCluster.
  • Keywords
    biology computing; data analysis; evolutionary computation; pattern clustering; DNA sequences; EvoCluster evolutionary algorithm; bioinformatics research; cluster grouping; evolutionary clustering algorithm; fitness function; gene expression microarray data analysis; local pairwise distances; performance evaluation; reproduction operators; significant biological binding sites; Bioinformatics; Biological cells; Biological system modeling; Clustering algorithms; Data analysis; Databases; Encoding; Evolutionary computation; Gene expression; Testing; Bioinformatics; DNA sequence analysis; clustering; evolutionary algorithms (EAs); gene expression microarray data analysis;
  • fLanguage
    English
  • Journal_Title
    Evolutionary Computation, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1089-778X
  • Type

    jour

  • DOI
    10.1109/TEVC.2005.859371
  • Filename
    1637689