Enhanced Web Page Ranking Method Using Laplacian Centrality

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    In today's era of computer technology where users want not only the most relevant data but they also want the data as quickly as possible. Hence, ranking web pages becomes a crucial task. The purpose of this research is to find a centrality measure that can be used in place of original page rank. In this article concept of Laplacian centrality measure for directed web graph has been introduced to identify the web page ranks. Comparison between the original page rank and Laplacian centrality based Page rank has been made. Kendall's  correlation co-efficient has been used as a measure to find the correlation between the original page rank and Laplacian centrality measure based page rank.



  • Keywords

    Centrality Measures; Laplacian centrality; PageRank; Web graph.

  • References

      [1] Conover W.J (1980), Practical Non-Parametric Statistics, 2nd edn., John Wiley and Sons, New York.

      [2] Crichton N.J (1999) Information point: Spearman's rank correlation, Journal of Clinical Nursing 8,763.

      [3] Jaganathan.B.,Kalyani Desikan (2015), Weighted Page Rank Algorithm Based on In-Out Weight of Webpages, International Journal of Science and Technology, 8 No. 34, 1-6.

      [4] Kurt Bryan,Tanya Leise (2006), The $25,000,000,000 Eigenvector: The linear algebra behind google, Society for Industrial and Applied Mathematics Philadelphia, PA, USA, 48 No. 3, 569-581.

      [5] Linton C. Freeman (2004), The Development of Social Network Analysis: A Study in the Sociology of Science,Social Networks, Empirical Press, Vancouver, BC, 27, 377–384.

      [6] Page, L., Brin, S., Motwani, R., Winograd. T (1998), The Page Rank Citation Ranking: Bringing Order to the Web-Technical re-port, stanford Digital Library Technologies Project, 1–17.

      [7] Xingqin Qi , Eddie Fuller,Qin Wu,Yezhou wu, Cun-Quan Zhang (2012), Laplacian centrality: A new centrality measure for weighted networks, Journal of Information Sciences, 194, 240-253.




Article ID: 21282
DOI: 10.14419/ijet.v7i4.10.21282

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.