Incremental Iteration Method for Fast PageRank Computation

Title
Incremental Iteration Method for Fast PageRank Computation
Authors
최용석
Keywords
Power iteration method; Incremental iteration method; PageRank calculation
Issue Date
2015-01
Publisher
ACM
Citation
ACM IMCOM 2015 - Proceedings 8 January 2015, Article number a80, Page. 431-436
Abstract
As the search services have been widely available on the web, page-ranking algorithm gained great attention in the recent decade. PageRank is the most popular ranking scheme that is currently well-known even to the public. PageRank uses a hyperlink matrix which represents the whole web structure and the size of the web is incredibly large in general so that a fast calculation method is needed to efficiently compute an enormous number of page ranks on the web. In this paper, we propose a new PageRank computation method, incremental iteration method in order to considerably reduce total computational cost. Our method makes good use of faster convergence procedure of power iteration than conventional one. Additionally, our method can be effectively combined with other conventional methods for more reduction of computational cost. In experiment, we demonstrate efficiency and effectiveness of our proposed method.
URI
http://hdl.handle.net/20.500.11754/21502http://dl.acm.org/citation.cfm?doid=2701126.2701165
ISBN
978-1-4503-3377-1
DOI
http://dx.doi.org/10.1145/2701126.2701165
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > ETC
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE