Based on Singular Value Decomposition Method of Binary Matrix Clustering Algorithm Research

In the literature search,we usually used LSI(Latent Semantic Indexing) algorithm. For the problem of the return value of the algorithm is impacted of the size of the threshold, the algorithm by the SVD(Singular Value Decomposition) resulting left and right singular value matrix, can be clustering by k-means algorithm,LSI improved algorithm is proposed. The experimental results show that, compared with the traditional method of LSI, improved algorithm when providing k- means algorithm classification dimension obtained better performance, prove the effectiveness of the algorithm.