• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Journal articles
    • View Item
    • Home
    • Griffith Research Online
    • Journal articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • Parallel biclustering detection using strength Pareto front evolutionary algorithm

    Author(s)
    Golchin, Maryam
    Liew, Alan Wee Chung
    Griffith University Author(s)
    Liew, Alan Wee-Chung
    Golchin, Maryam
    Year published
    2017
    Metadata
    Show full item record
    Abstract
    Biclustering has become a popular technique to analyse gene expression datasets and extract valuable information by clustering rows and columns of a dataset simultaneously. Using a good merit function together with a suitable local search can lead to the detection of interesting biclusters. In this paper, a multi-objective evolutionary algorithm with local search is proposed to search for multiple biclusters concurrently in a single run of the evolutionary algorithm. We call our method PBD-SPEA2 (Parallel Biclustering Detection using Strength Pareto front Evolutionary Algorithm 2). In our algorithm, a new dynamic encoding ...
    View more >
    Biclustering has become a popular technique to analyse gene expression datasets and extract valuable information by clustering rows and columns of a dataset simultaneously. Using a good merit function together with a suitable local search can lead to the detection of interesting biclusters. In this paper, a multi-objective evolutionary algorithm with local search is proposed to search for multiple biclusters concurrently in a single run of the evolutionary algorithm. We call our method PBD-SPEA2 (Parallel Biclustering Detection using Strength Pareto front Evolutionary Algorithm 2). In our algorithm, a new dynamic encoding scheme is used to encode multiple biclusters in each individual. Our multi-objective function consists of three objectives that simultaneously optimizes the homogeneity of the elements in the bicluster, the size of the bicluster, and the variance of the column in the bicluster with respect to the entire dataset. Crossover is done by selecting and combining the best biclusters among the encoded biclusters from both parents through a strategy of exploration and exploitation. Finally, a sequential selection procedure is used to select the final set of biclusters from individuals that constitute the Pareto front. Experimental results are presented to compare the performance and biological enrichment of detected biclusters with several existing algorithms.
    View less >
    Journal Title
    Information Sciences
    Volume
    415-416
    DOI
    https://doi.org/10.1016/j.ins.2017.06.031
    Subject
    Mathematical sciences
    Engineering
    Publication URI
    http://hdl.handle.net/10072/348636
    Collection
    • Journal articles

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander