Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/NCVPRIPG.2013.6776152 | National Conference on Computer Vision Pattern Recognition Image Processing and Graphics |
Keywords | DocType | ISSN |
number of clusters,short-texts,term-weighting,uncoupling,spectral method | Conference | 2372-658X |
Citations | PageRank | References |
1 | 0.36 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| anil goyal | 1 | 1 | 0.36 |
| Mukesh K. Jadon | 2 | 3 | 1.41 |
| Arun K. Pujari | 3 | 420 | 48.20 |