Document clustering using a new similarity measure based on energy of a bipartite graph

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Grace, G. H., & Desikan, K. (2016). Document clustering using a new similarity measure based on energy of a bipartite graph. Indian Journal of Science and Technology, 9(40). https://doi.org/10.17485/ijst/2016/v9i40/99005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free