Actas de congresos
Bicaco: An Ant Colony Inspired Biclustering Algorithm
Registro en:
3540875263; 9783540875260
Lecture Notes In Computer Science (including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics). , v. 5217 LNCS, n. , p. 401 - 402, 2008.
3029743
10.1007/978-3-540-87527-7_45
2-s2.0-56449084283
Autor
De Franca F.O.
Coelho G.P.
Von Zuben F.J.
Institución
Resumen
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. 5217 LNCS
401 402 Cheng, Y., Church, G.M., Biclustering of expression data (2000) Proc. of the 8th Int. Conf. on Inteligent Systems for Molecular Biology, pp. 93-103 Dorigo, M., (1992) Optimization, Learning and Natural Algorithms, , PhD thesis, Politecnico di Milano, Italy de França, F.O., Von Zuben, F.J., de Castro, L.N., Max min ant system and capacitated p-medians: Extensions and improved solutions (2005) Informatica, 29 (2), pp. 163-172 Jiong, Y., Haixun, W., Wei, W., Yu, P.S., Enhanced biclustering on expression data (2003) Proc. of the Third IEEE Symposium on Bioinformatics and Bioengineering, pp. 321-327 Cho, R., Campbell, M., Winzeler, E., Steinmetz, L., Conway, A., Wodicka, L., Wolfsberg, T., Davis, R., A genome-wide transcriptional analysis of the mitotic cell cycle (1998) Molecular Cell, 2, pp. 65-73