Document clustering based on concept lattice
基于概念格的文本聚类

It is still difficult to deal with the dimension catastrophe, the sparse vector, and random selection of initial center in standard K-Means algorithm. A new clustering method based on concept lattice without evaluation function was proposed in this paper. Finally, an experiment was given. The results clearly show the outstanding performance of the proposed method in terms of correctness and efficiency.