Home // ICDS 2014, The Eighth International Conference on Digital Society // View article

A Generalization of the PageRank Algorithm

Authors:
Zeynab Bahrami Bidoni
Roy George
Khalil Shujaee

Keywords: Search Engine; PageRank; Web Structure; Web Mining; Spider-Trap; dead-end; Taxation;Web spamming

Abstract:
PageRank is a well-known algorithm that has been used to understand the structure of the Web. In its classical formulation the algorithm considers only forward looking paths in its analysis- a typical web scenario. We propose a generalization of the PageRank algorithm based on both out-links and in-links. This generalization enables the elimination network anomalies- and increases the applicability of the algorithm to an array of new applications in networked data. Through experimental results we illustrate that the proposed generalized PageRank minimizes the effect of network anomalies, and results in more realistic representation of the network.

Pages: 108 to 113

Copyright: Copyright (c) IARIA, 2014

Publication date: March 23, 2014

Published in: conference

ISSN: 2308-3956

ISBN: 978-1-61208-324-7

Location: Barcelona, Spain

Dates: from March 23, 2014 to March 27, 2014