کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4638797 | 1632013 | 2015 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A two-step matrix splitting iteration for computing PageRank
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A two-step matrix splitting iteration for computing PageRank A two-step matrix splitting iteration for computing PageRank](/preview/png/4638797.png)
چکیده انگلیسی
The PageRank algorithm plays an important role in determining the importance of Web pages. The core of this algorithm involves using the classical power method to compute the PageRank vector, which is the principal eigenvector of the matrix representing the Web link graph. Nevertheless, it is well known that the power method may perform poorly when the second largest eigenvalue is close to the dominant one. In this article, we present a new approach that is based on the two-step splitting iteration framework. The description and convergence of the new algorithm are discussed in detail. Numerical examples are given to illustrate the performance of this algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 278, 15 April 2015, Pages 19–28
Journal: Journal of Computational and Applied Mathematics - Volume 278, 15 April 2015, Pages 19–28
نویسندگان
Chuanqing Gu, Fei Xie, Ke Zhang,