B. Jaganathan ¹, Kalyani Desikan ¹

Affiliations
1 Division of Mathematics, School of Advanced Sciences (SAS), VIT-Chennai, Chennai – 600048, Tamil Nadu, IN

Abstract

In its classical formulation, the well known page rank algorithm ranks web pages only based on in-links between web pages. We propose a new in-out weight based page rank algorithm. In this paper, we have introduced a new weight matrix based on both the in-links and out-links between web pages to compute the page ranks. We have illustrated the working of our algorithm using a web graph. We notice that the page rank values of the web pages computed using the original page rank algorithm and our proposed algorithm are comparable. Moreover, our algorithm is found to be efficient with respect to the time taken to compute the page rank values.

Keywords

Algorithm, In-Weight, Out-Weight, Page Rank, Web Pages

Full Text

   

G. Hannah Grace ¹, Kalyani Desikan ¹

Affiliations
1 Department of Mathematics, School of Advanced Sciences, VIT University, Chennai - 600127, Tamil Nadu, IN

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.

Keywords

Bipartite Graph, Cluster Quality, Document Clustering, Energy, Similarity Measure.

Full Text