Given a set of m rows in n columns (an m × n matrix), the biclustering algorithm generates biclusters-a subset of rows that exhibit similar behavior across a subset of columns, or vice versa.
Given a set of m rows in n columns (an m × n matrix), the biclustering algorithms work with a matrix of m row and n columns, representing m objects of n attributes. A bicluster is a subset of rows that exhibit similar behavior across a subset of columns, and vice versa.