A novel approach to text clustering using shift k-medoid Online publication date: Mon, 17-Jun-2019
by Mohit; A. Charan Kumari; Meghna Sharma
International Journal of Social Computing and Cyber-Physical Systems (IJSCCPS), Vol. 2, No. 2, 2019
Abstract: As the amount of data is growing day by day, there is a need to convert it into some effective manner so as to extract some useful information from huge data. Text mining is used to perform this task. In this paper, text clustering is used to convert the large data into different cluster forms to extract the meaningful information for the purpose of analysis so as to get the summarised data. Three partitioning-based clustering techniques, i.e., k-means, k-means fast and k-medoids are compared, and a new algorithm named shift k-medoid is proposed, which is hybrid of k-medoid and mean shift clustering algorithms. Cosine similarity, correlation coefficient and Jaccard similarity measures are used to check the performance of the algorithms and two measures, i.e., randomised feature and normalised mutual information (NMI) feature are used to test the accuracy of the algorithms. The outcomes demonstrate that the best performance is accomplished by using the proposed algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Social Computing and Cyber-Physical Systems (IJSCCPS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook