Abstract
Power method is one of the basic iterative method used by Brin and Page to compute the PageRank vector. However, this method may not be efficient when the hyperlink matrix becomes large or damping factor value closes to 1. In last few years, Researchers have considered several numerical methods like Gauss-Seidel, Monte-Carlo, and Arnoldi extrapolation to accelerate the convergence of PageRank computation. In this paper, we have proposed a novel iterative method to compute the PageRank vector of hyperlink matrix by using Aitken extrapolation algorithm. Also, we have analyzed convergence behavior of proposed algorithm i.e. Aitken-extrapolation Gauss Seidel. Further, we have compared Aitken-extrapolation Gauss Seidel algorithm to existing methods such as Power method, Aitken-Power, and Gauss-Seidel method experimentally and found that our method is more feasible and efficient as compared to these existing approaches.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
