Incremental iteration method for fast pagerank computation
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Kyung Soo | - |
dc.contributor.author | Choi, Yong Suk | - |
dc.date.accessioned | 2022-07-16T00:53:41Z | - |
dc.date.available | 2022-07-16T00:53:41Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2015-01 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/158081 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery, Inc | - |
dc.title | Incremental iteration method for fast pagerank computation | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choi, Yong Suk | - |
dc.identifier.doi | 10.1145/2701126.2701165 | - |
dc.identifier.scopusid | 2-s2.0-84926164902 | - |
dc.identifier.bibliographicCitation | ACM IMCOM 2015 - Proceedings, pp.1 - 5 | - |
dc.relation.isPartOf | ACM IMCOM 2015 - Proceedings | - |
dc.citation.title | ACM IMCOM 2015 - Proceedings | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 5 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Cost reduction | - |
dc.subject.keywordPlus | Hypertext systems | - |
dc.subject.keywordPlus | Information management | - |
dc.subject.keywordPlus | Social networking (online) | - |
dc.subject.keywordPlus | Computational costs | - |
dc.subject.keywordPlus | Conventional methods | - |
dc.subject.keywordPlus | Fast calculations | - |
dc.subject.keywordPlus | Faster convergence | - |
dc.subject.keywordPlus | Iteration method | - |
dc.subject.keywordPlus | PageRank | - |
dc.subject.keywordPlus | PageRank computations | - |
dc.subject.keywordPlus | Search services | - |
dc.subject.keywordPlus | Iterative methods | - |
dc.subject.keywordAuthor | Incremental iteration method | - |
dc.subject.keywordAuthor | PageRank calculation | - |
dc.subject.keywordAuthor | Power iteration method | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/2701126.2701165 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.