Abstract

Grouping is a broadly utilized unaided information mining method. In Clustering, the primary point is to put comparative information objects in a single group and different in another variety. The k-means is the most well-known grouping calculation due to its ease. However, the k-means clustering calculation exhibition relies on the limit choice. A limit choice like the number of groups and commencement group community is critical to the k-means calculation. Distance increase strategy, thickness technique, and quadratic grouping strategies are used to determine the initial set. However, these strategies have a few limits. This paper has proposed encouraging text grouping strategy with k-means to examine text information to work on this methodology. This paper inspects five similar practices: Further developed k-means text clustering calculation, Returning to k-means, LMMK calculation, SELF-DATA design, Clustering Approach for Relation etc.

References

1. Caiquan Xiong Zhen Hua KeLv Xuan Li “An Improved K-means text clustering algorithm By Optimizing initial cluster centers” International Conference on Cloud Computing and Big Data2016
2. M.Alhawarat And M. Hegazi “Revisiting K-Means and Topic Modeling, a Comparison Study to Cluster Arabic Documents” IEEE Access2017
3. Jing Yang and Jun Wang “Tag clustering algorithm LMMSK: improved K-means algorithm based on latent semantic “Journal of Systems Engineering and Electronics April2017
4. Tania Cerquitelli Evelina Di Corso Francesco Ventura Silvia Chiusano “Data miners’ little helper: Data transformation activity cues for cluster analysis on document collections” ACM Reference format June 2017
5. P. DAS, A. K. DAS, J. NAYAK, D. PELUSI, W. DING. “A Graph based Clustering Approach for Relation Extraction from Crime Data” IEEE Access.2019

Download PDF
Back