Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 40, Pages: 1-7
G. Hannah Grace* and Kalyani Desikan
Department of Mathematics, School of Advanced Sciences, VIT University, Chennai - 600127, Tamil Nadu, India; [email protected]
*Author for correspondence
Department of Mathematics
Email: [email protected]
Objectives: This paper aims at clustering documents using a new similarity measure based on energy of a bipartite graph. Methods/Statistical Analysis: We have made use of bipartite representation of documents and clustered them. The proposed algorithm has been illustrated for a small document set. The documents have been clustered using the new similarity measure based on energy of a bipartite graph introduced by us. Findings: Our proposed algorithm gives a better clustering quality comparing with the k means clustering algorithm. Application/Improvements: This proposed algorithm can be further extended and applied to cluster large document sets.
Keywords: Bipartite Graph, Cluster Quality, Document Clustering, Energy, Similarity Measure
Subscribe now for latest articles and news.