Document Clustering using K-Medoids

People are always in search of matters for which they are prone to use internet, but again it has huge assemblage of data due to which it becomes difficult for the reader to get the most accurate data. To make it easier for people to gather accurate data, similar information has to be clustered at one place. There are many algorithms used for clustering of relevant information in one platform. In this paper, K-Medoids clustering algorithm has been employed for formation of clusters which is further used for document summarization.

[1]  Hassan Abolhassani,et al.  Harmony K-means algorithm for document clustering , 2009, Data Mining and Knowledge Discovery.

[2]  Dimitar Kazakov,et al.  WordNet-based text document clustering , 2004 .

[4]  Agma J. M. Traina,et al.  An Efficient Approach to Scale up k-medoid based Algorithms in Large Databases , 2006, SBBD.

[5]  C. Lee Giles,et al.  K-SVMeans: A Hybrid Clustering Algorithm for Multi-Type Interrelated Datasets , 2007, IEEE/WIC/ACM International Conference on Web Intelligence (WI'07).

[6]  George Karypis,et al.  A Comparison of Document Clustering Techniques , 2000 .

[7]  Jiawei Han,et al.  Document clustering using locality preserving indexing , 2005, IEEE Transactions on Knowledge and Data Engineering.