Gene expression biclustering using random walk strategies

Authors:
Fabrizio Angiulli;Clara Pizzuti
Affiliations:
ICAR-CNR, Università della Calabria, Rende, (CS), Italy;ICAR-CNR, Università della Calabria, Rende, (CS), Italy
Venue:
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Year:
2005

Citing 5
Cited 3

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Biclustering of Expression Data

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Enhanced Biclustering on Expression Data

BIBE '03 Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering
Biclustering Algorithms for Biological Data Analysis: A Survey

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Mean Square Residue Biclustering with Missing Data and Row Inversions

ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Finding multiple coherent biclusters in microarray data using variable string length multiobjective genetic algorithm

IEEE Transactions on Information Technology in Biomedicine - Special section on body sensor networks
Mean squared residue based biclustering algorithms

ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial random solution and searches for a locally optimal solution by successive transformations that improve a gain function, combining the mean squared residue, the row variance, and the size of the bicluster. Different strategies to escape local minima are introduced and compared. Experimental results on yeast and lymphoma microarray data sets show that the method is able to find significant biclusters.