Sciweavers

3894 search results - page 2 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
SDM
2011
SIAM
198views Data Mining» more  SDM 2011»
12 years 8 months ago
Exemplar-based Robust Coherent Biclustering
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
Kewei Tu, Xixiu Ouyang, Dingyi Han, Vasant Honavar
PODS
2008
ACM
153views Database» more  PODS 2008»
14 years 5 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
BMCBI
2008
114views more  BMCBI 2008»
13 years 5 months ago
A visual analytics approach for understanding biclustering results from microarray data
Background: Microarray analysis is an important area of bioinformatics. In the last few years, biclustering has become one of the most popular methods for classifying data from mi...
Rodrigo Santamaría, Roberto Therón, ...
EVOW
2005
Springer
13 years 11 months ago
Evolutionary Biclustering of Microarray Data
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
Jesús S. Aguilar-Ruiz, Federico Divina
BIBE
2007
IEEE
134views Bioinformatics» more  BIBE 2007»
13 years 11 months ago
Bottom-Up Multiple Row Addition Algorithms for the Biclustering-Problem
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
Hyung-Won Koh, Lars Hildebrand