Spectral approach to find number of clusters of short-text documents

We propose a technique of determining the number of clusters of a corpus of short-text documents. A spectral algorithm suitable for short-texts is used to generate an ensemble. A Markov chain induced by the co-association matrix is studied to observe nearly uncoupling phenomenon over iterations. A large spectral gap and number of eigenvectors close to 1 indicate the number of clusters. We demonstrate by experimenting on several datasets.