Hi Saira,
Many algorithms you can used and compared for hierarchical clustering task on text data. I could recommend you to read the systematic literature review first, some of them are listed here:
- Hierarchical Document Clustering: A Review
- Document Clustering: A Detailed Review
And then you also used these algorithms:
- Katz-Classit Algorithm by Sahoo, et.al (Incremental Hierarchical Clustering of Text Documents in ACM CIKM 2016) (http://dl.acm.org/citation.cfm?id=1183667)
- Latest algoritms, Roy Model by Roy & Pokutta (Hierarchical Clustering via Spreading Metrics in NIPS 2016) (https://128.84.21.199/abs/1610.09269)
Good luck.
There are various text based clustering algorithms available....After applying clustering algorithms...you should have to measure the quality of your results using various indices which will give better quality of clusters.....But your quality of results also depends on the characteristics of your text datasets......You may check the below papers to get some initial ideas....
http://airccse.org/journal/jcsit/1211csit04.pdf
http://www.kdd.org/kdd2016/papers/files/rpp0617-yinAemb.pdf
https://www.ijarcsse.com/docs/papers/Volume_4/11_November2014/V4I11-0120.pdf
http://www.ijcsmc.com/docs/papers/June2015/V4I6201599a49.pdf
http://cs.fit.edu/~pkc/classes/ml-internet/papers/steinbach00tr.pdf
In my opinion, you can combine K-means and other hierarchical algorithms. K-means is better than other algorithms, but deciding k values, and the center of the k values are the hard problem. You can define k values by using hierarchical algorithms, then you can use k-means for your problem...
You can follow this paper
Sahoo, N., Callan, J., Krishnan, R., Duncan, G., & Padman, R. (2006, November). Incremental hierarchical clustering of text documents. In Proceedings of the 15th ACM international conference on Information and knowledge management (pp. 357-366). ACM.
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Software