An efficient document clustering using hybridised harmony search K-means algorithm with multi-view point

摘要

Document clustering is the most needed process in the data mining field where the number of documents with different methodologies are scattered. The meaningful information can be extracted from the group of documents by grouping them effectively. There are various researches that exist previously which concentrate on clustering the documents present in the real. In the previous works, document clustering is done by using the methodologies called the term weight-based hybridised harmony K-means search (TW HHKM), coverage factor-based hybridised harmony K-means search (CF HHKM), concept-based, kernel and weighted feature-based clustering algorithm (CKW HHKM). Clustering is normally done by using the K-means algorithm and the centroids of clusters are found optimally by using the harmony search algorithm. The problem reside in the above said existing methods are the poor accuracy while clustering the documents where the unrelated documents are grouped together. To overcome this problem, multi-view point HHKM (MP HHKM) approach is introduced, in which clustering can be done accurately. In this work, multi-point analysis is done based on the similarity measurement. The exploratory tests were directed on news group and TREC dataset from which it is robust that the proposed technique MP HHKM overtakes the existing technique with better accuracy values.