113 Hits in 4.9 sec

Distributed PageRank computation based on iterative aggregation-disaggregation methods

Yangbo Zhu, Shaozhi Ye, Xing Li
2005 Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05  
In this paper, we propose a distributed PageRank computation algorithm based on iterative aggregation-disaggregation (IAD) method with Block Jacobi smoothing. The basic idea is divide-and-conquer.  ...  We believe our work provides an efficient and practical distributed solution for PageRank on large scale Web graphs.  ...  CONCLUSION AND FUTURE WORK This paper proposes a distributed PageRank computation algorithm based on iterative aggregation-disaggregation (IAD) methods with Block Jacobi smoothing.  ... 
doi:10.1145/1099554.1099705 dblp:conf/cikm/ZhuYL05 fatcat:7yrwj74o6za5hhlrd7p3mvrg2i

Page Ranking: Summary

Sonia Gupta
2013 IOSR Journal of Engineering  
Here we discuss some methods of converging pageranking based on ordering of pages. Here pageranking is compared to idealized random surfing of net.  ...  HITS focuses on mutual reinforcement between authority and hub webpages, while PageRank focuses on hyperlink weight normalization and web surfing based on random walk models.  ...  Aggregation/disaggregation methods are based on the idea.  ... 
doi:10.9790/3021-03542631 fatcat:v5f3eiqcqjcudpawymanz4gzse

A Survey and Comparative Study of Different PageRank Algorithms

Tahseen A.Jilani, Ubaida Fatima, Mirza Mahmood Baig, Saba Mahmood
2015 International Journal of Computer Applications  
Google's PageRank attempted to solve this problem using computing of principle Eigenvalues termed as PageRank vector.  ...  This is paper, we have reviewed a number of of PageRank computation techniques. The main objective of all these techniques is the convergence rate along with space and time complexities.  ...  Therefore this method is known for its consistent and authentic executions. [1] Aggregation or Disaggregation Iterative Approach Aggregation or Disaggregation iterative method is used to expeditiously  ... 
doi:10.5120/21410-4444 fatcat:huibgvhilbhunmbdkbtsugf3a4

The Extrapolation-Accelerated Multilevel Aggregation Method in PageRank Computation

Bing-Yuan Pu, Ting-Zhu Huang, Chun Wen, Yi-Qin Lin
2013 Mathematical Problems in Engineering  
We show how to periodically combine the extrapolation method together with the multilevel aggregation method on the finest level for speeding up the PageRank computation.  ...  An accelerated multilevel aggregation method is presented for calculating the stationary probability vector of an irreducible stochastic matrix in PageRank computation, where the vector extrapolation method  ...  The multilevel aggregation method, based on the neighborhood-based aggregation strategy, introduced by De Sterck et al. in [11, 12, 28, 29] can be expressed as follows.  ... 
doi:10.1155/2013/525313 fatcat:ctf4ywmtsbcyhktpnwibfdun3e

A survey on distributed approaches to graph based reputation measures

Konstantin Avrachenkov, Danil Nemirovsky, Kim Son Pham
2007 Proceedings of the 2nd International ICST Conference on Performance Evaluation Methodologies and Tools  
The second category is based on the aggregation/decomposition methods. And the third category is based on the personalization methods which use local information.  ...  We classify the distributed approaches to graph based reputation measures into three categories. The first category is based on asynchronous methods.  ...  The method is proved to be theoretically equivalent to iterative aggregation-disaggregation method based on Block Jordan decomposition [34] .  ... 
doi:10.4108/smctools.2007.2027 dblp:conf/valuetools/AvrachenkovNP07 fatcat:ko4tznkxyzbztnsgrmp2rc5zeq

Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer

Ilse C. F. Ipsen, Steve Kirkland
2006 SIAM Journal on Matrix Analysis and Applications  
The PageRank updating algorithm proposed by Langville and Meyer is a special case of an iterative aggregation/disaggregation (SIAD) method for computing stationary distributions of very large Markov chains  ...  It is designed, in particular, to speed up the determination of PageRank, which is used by the search engine Google in the ranking of web pages.  ...  Iterative aggregation/disaggregation (SIAD). The iterative aggregation/disaggregation (SIAD) method [12, 13, 15] is an updating algorithm designed to compute PageRank.  ... 
doi:10.1137/s0895479804439808 fatcat:earuvlb3rjcnppvbfztj3japn4

On Accelerating the PageRank Computation

Steve Osborne, Jorge Rebaza, Elizabeth Wiggins
2009 Internet Mathematics  
By combining some of the existing techniques and different approaches, including the power method, linear systems, iterative aggregation/disaggregation, and matrix reorderings, we propose algorithms that  ...  In this paper we consider the problem of computing the PageRank vector in an efficient way.  ...  Iterative Aggregation/Disaggregation Another attempt at outperforming the power method in the computation of the PageRank vector comes from the theory of Markov chains.  ... 
doi:10.1080/15427951.2009.10129182 fatcat:fjuajbnko5h2beuywztndrerqy

A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations

Chris P. Lee, Gene H. Golub, Stefanos A. Zenios
2007 Internet Mathematics  
We present a two-stage algorithm for computing the PageRank vector where the algorithm exploits the lumpability of the underlying Markov chain. We make three contributions.  ...  The algorithm can also embed other acceleration methods such as quadratic extrapolation, the Gauss-Seidel method, or the Biconjugate gradient stable method for an even greater speed-up; cumulative speedup  ...  We emphasize three points: (1) The standard PageRank algorithm is an iterative algorithm based on the power method. We derive a similar algorithm for STAGE1.  ... 
doi:10.1080/15427951.2007.10129151 fatcat:p5abfiupgnegjlesyrztasf6ki

Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems

Zhao-Li Shen, Ting-Zhu Huang, Bruno Carpentieri, Chun Wen, Xian-Ming Gu
2018 Communications in nonlinear science & numerical simulation  
Recently, the adaptive algebraic aggregation multigrid method has been proposed for computing stationary distributions of Markov chains.  ...  This method updates aggregates on every iterative cycle to keep high accuracies of coarse-level corrections.  ...  In 1970s, the iterative aggregation/disaggregation (IAD) method [11] has been proposed for solving Markov chains.  ... 
doi:10.1016/j.cnsns.2017.11.031 fatcat:vshaccn7dfd45g5rfnsfxyxdru

Improved Parallel Computation of PageRank for Web Searching

Hema Dubey, Nilay Khare, Appu Kuttan KK
2016 Indian Journal of Science and Technology  
Methods/Statistical Analysis: In this paper, we have proposed an efficient and accelerated parallel computation of PageRank scores on Graphics Processing Units (GPUs) which uses non even distribution of  ...  Efficient and fast computation of PageRank values for prodigious web graphs is indeed an important issue for web search engines today.  ...  In 15 proposed a distributed PageRank calculation using Iterative Aggregation-Disaggregation (IAD) method through divide-and-conquer technique to effectively speedup the PageRank computation in a distributed  ... 
doi:10.17485/ijst/2016/v9is1/102825 fatcat:34ajqhqbsjdw5knljdc5nwkix4

Optimized on-line computation of PageRank algorithm [article]

Dohy Hong
2012 arXiv   pre-print
In this paper we present new ideas to accelerate the computation of the eigenvector of the transition matrix associated to the PageRank algorithm.  ...  We show through experiments on synthetic data and on real data-sets how much this approach can improve the computation efficiency.  ...  aggregation/disaggregation method [21, 13, 23] , adaptive on-line method [1] , etc.  ... 
arXiv:1202.6158v1 fatcat:nrethmnv6nfbxhjlamoodg7omi

Adaptive methods for the computation of PageRank

Sepandar Kamvar, Taher Haveliwala, Gene Golub
2004 Linear Algebra and its Applications  
We use this observation to devise a simple algorithm to speed up the computation of PageRank, in which the PageRank of pages that have converged are not recomputed at each iteration after convergence.  ...  We observe that the convergence patterns of pages in the PageRank algorithm have a nonuniform distribution.  ...  Kamvar et al. use extrapolation techniques in [13] and aggregation/disaggregation techniques in [12] to significantly speed up convergence.  ... 
doi:10.1016/j.laa.2003.12.008 fatcat:wbupdwhip5ghjkdvsl4qqjfx7i

Updating Markov Chains with an Eye on Google's PageRank

Amy N. Langville, Carl D. Meyer
2006 SIAM Journal on Matrix Analysis and Applications  
An iterative algorithm based on aggregation/disaggregation principles is presented for updating the stationary distribution of a finite homogeneous irreducible Markov chain.  ...  The focus is on large-scale problems of the kind that are characterized by Google's PageRank application, but the algorithm is shown to work well in general contexts.  ...  We thank Ronny Lempel for generously supplying the three datasets on movies, abortion, and genetics, and we thank Cleve Moler for sharing his MathWorks dataset as well as other Web-crawling M-files.  ... 
doi:10.1137/040619028 fatcat:pn2zgypmkvdablgrunwr24rrji

Local dependency in networks

Miloš Kudĕlka, Šárka Zehnalová, Zdenĕk Horák, Pavel Krömer, Václav Snášel
2015 International Journal of Applied Mathematics and Computer Science  
Network analysis focuses on the relations among the nodes exploring the properties of each network.  ...  Since only the surroundings of the examined nodes are used in computations, there is no need to analyze the entire network.  ...  Distributed PageRank computation based on iterative aggregation-disaggregation methods, Proceedings of the 14th ACM International Conference on Information and Knowledge Management, CIKM'05, Bremen, Germany  ... 
doi:10.1515/amcs-2015-0022 fatcat:2a4iz76w5bbc5jqjzgopnrfcim

A Survey on PageRank Computing

Pavel Berkhin
2005 Internet Mathematics  
Components of a PageRank vector serve as authority weights for web pages independent of their textual content, solely based on the hyperlink structure of the web.  ...  We are interested in the theoretical foundations of the PageRank formulation, in the acceleration of PageRank computing, in the effects of particular aspects of web graph structure on the optimal organization  ...  /disaggregation method.  ... 
doi:10.1080/15427951.2005.10129098 fatcat:ahbwdzfelzbfrcpzsoqae4w2za
« Previous Showing results 1 — 15 out of 113 results