bicACO: An Ant Colony Inspired Biclustering Algorithm

  • Authors:
  • Fabrício O. França;Guilherme P. Coelho;Fernando J. Zuben

  • Affiliations:
  • Laboratory of Bioinformatics and Bioinspired Computing (LBiC), University of Campinas (Unicamp), Campinas, SP, Brazil;Laboratory of Bioinformatics and Bioinspired Computing (LBiC), University of Campinas (Unicamp), Campinas, SP, Brazil;Laboratory of Bioinformatics and Bioinspired Computing (LBiC), University of Campinas (Unicamp), Campinas, SP, Brazil

  • Venue:
  • ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A recent proposal developed to avoid some of the drawbacks presented by standard clustering algorithms is the so-called biclusteringtechnique [1], which performs clustering of rows and columns of the data matrix simultaneously, allowing the extraction of additional information from the dataset. Since the biclustering problem is combinatorial, and ant-based systems present several advantages when dealing with this kind of problems [2], in this work we propose an antinspired algorithm for biclustering, which was named bicACO.