Penalty Matrix-based PageRank Algorithm

B. Jaganathan, Kalyani Desikan

Abstract


In this paper we give a brief overview of the adjacency matrix based page rank algorithm and eigen vector based page rank that are used in the Google search engine. In this paper a new approach has been introduced by considering the web as a mixed graph rather than a simple graph. We propose an improved method for the computation of page rank on the basis of penalty assigned to web pages which are accessed through Advertisement links/pages. Consequently, we have applied the concept of column-stochastic Penalty Matrix to web page ranking. This approach does not involve any iterative technique. This method is based only on the concept of Eigen values and Eigen vectors of the Penalty matrix.

Keywords


Page rank; Eigen values; Eigen vector; Penalty matrix

Full Text:

PDF

References


A.N. Langville and C.D. Meyer, Google's PageRank and Beyond, The Science of Search Engine Rankings, Princeton University Press, Princeton (2006).

F. Schneider, N. Blachman and E. Fredricksen, How to Do Everything with Google?, McGraw-Hill, New York (2003)

L. Page, S. Brin, R. Motwani and T. Winograd, The page rank citation ranking: bringing order to the web, Technical Report, Stanford Digital Library Technologies Project (1998).

W. Xing and G. Ali, Weighted pagerank alogithm, in Proceedings of the Second Annual Conference on Communication Networks and Services Research (CNSR'04), IEEE (2004).

B. Jaganathan and K. Desikan, Category-based pagerank algorithm, International Journal of Pure and Applied Mathematics 101 (5) (2015), 811 – 820.

B. Jaganathan and K. Desikan, Penalty-Based Pagerank Algorithm, ARPN Journal of Engineering and Applied Sciences 10 (5) (2015), 2000 – 2003.

B. Jaganathan and K. Desikan, Weighted Pagerank Algorithm based on In-Out weight of webpages, Indian Journal of Science and Technology 8 (34) (2015), 1–6.

B. Jaganathan and K. Desikan, Hermition matrix based Pagerank Algorithm, Global Journal of Pure and Applied Mathematics 12 (3) (2016), 277–280.

M. Bressan AND E. Peserico, Choose the damping, choose the ranking?, Journal of Discrete Algorithms 8 (2010), 199 – 213.

K. Bryan and T. Leise, The $25,000,000,000 eigenvector: the linear algebra behind Google, Society for Industrial and Applied Mathematics Philadelphia, PA, USA, Vol. 48 (3) (2006), 569 – 581.




DOI: http://dx.doi.org/10.26713%2Fjims.v9i3.813

eISSN 0975-5748; pISSN 0974-875X