J. G. Liang

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Text documents are often high dimensional and sparse, it is a great challenge to discover the clusters among the unlabelled text data, because there are no obvious clusters by common distance measure. In this paper we present a latent subspace clustering method to find text clusters. In our algorithm, we use latent factors extracted by probability latent(More)
  • 1