… In order to see how good is the maximal element in our "good" submatrix, we tested it first
on random matrices. Given n, m, r, two matrices U and y were generated with elements …

… In order to see how good is the maximal element in our “good” submatrix, we tested it first
on random matrices. Given m, m, r, two matrices Ll and V were generated with elements …

… that if one has a good approximation to the maximum volume k × k sub-matrix, then the rows
… of how similar they are). Along these lines, the effort has been trying to find a sub-matrix with …

… In order to assess how well the set of samples associated with a bicluster captures a … Other
methods did not perform particularly well, though we note that ISA did a good job of capturing …

… case, deciding how many terms to include in the decomposition in order to get a good fit to …
from an equation like the SVD, but based on a submatrix of X that does not include xij. In both …

… present a recent subclass of NMF problems, referred to as near-separable NMF, that can be
solved efficiently (that is, in polynomial time), even in the presence of noise—this is the how. …

… Then, as to how many submatrices to select, we will choose the minimum … to find the best
minimum number of submatrices needed to recover Wr. This allows us to analyze how good the …

… how to remove this assumption. Note that this assumption implies that every s × n submatrix
is good, and similarly every n × s submatrix … we consider the legal good submatrix that is four …

… Now we discuss how to automatically determine the parameters based on the available …
Using another large Affymetrix data set (expO), we show that KiWi is also very good at grouping …

… However, in reality, physical mapping is prone to various errors and the physical mapping …
A and A , and a good approximation solution to A is also a good approximation to A. Therefore…