BicACO: An ant colony inspired biclustering algorithm

13Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A recent proposal developed to avoid some of the drawbacks presented by standard clustering algorithms is the so-called biclustering technique [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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

De França, F. O., Coelho, G. P., & Von Zuben, F. J. (2008). BicACO: An ant colony inspired biclustering algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5217 LNCS, pp. 401–402). https://doi.org/10.1007/978-3-540-87527-7_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free