Abstract: In this paper, we propose a singular vector space biclustering algorithm for 0/1 binary clustering problems.At first, we compute the left and right singular vector matrices from the input 0/1 matrix, then the priority between the column-clustering and the row-clustering is determined based on information entropy.Finally, the column-clustering and the row-clustering are repeated iteratively until the stopping criterion is satisfied.Experimental results show that our algorithm can identify those completely non-overlapping sub-matrices and find the "hard" biclusters more efficiently.