File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1002/nla.789
- Scopus: eid_2-s2.0-84855210269
- WOS: WOS:000298595300006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: On adaptively accelerated Arnoldi method for computing PageRank
| Title | On adaptively accelerated Arnoldi method for computing PageRank |
|---|---|
| Authors | |
| Keywords | Weighted least squares problem Arnoldi process Eigenvalue and eigenvector PageRank Power method |
| Issue Date | 2012 |
| Citation | Numerical Linear Algebra with Applications, 2012, v. 19, n. 1, p. 73-85 How to Cite? |
| Abstract | A generalized refined Arnoldi method based on the weighted inner product is presented for computing PageRank. The properties of the generalized refined Arnoldi method were studied. To speed up the convergence performance for computing PageRank, we propose to change the weights adaptively where the weights are calculated based on the current residual corresponding to the approximate PageRank vector. Numerical results show that the proposed Arnoldi method converges faster than existing methods, in particular when the damping factor is large. © 2011 John Wiley & Sons, Ltd. |
| Persistent Identifier | http://hdl.handle.net/10722/276912 |
| ISSN | 2023 Impact Factor: 1.8 2023 SCImago Journal Rankings: 0.932 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Yin, Jun Feng | - |
| dc.contributor.author | Yin, Guo Jian | - |
| dc.contributor.author | Ng, Michael | - |
| dc.date.accessioned | 2019-09-18T08:35:02Z | - |
| dc.date.available | 2019-09-18T08:35:02Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.citation | Numerical Linear Algebra with Applications, 2012, v. 19, n. 1, p. 73-85 | - |
| dc.identifier.issn | 1070-5325 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/276912 | - |
| dc.description.abstract | A generalized refined Arnoldi method based on the weighted inner product is presented for computing PageRank. The properties of the generalized refined Arnoldi method were studied. To speed up the convergence performance for computing PageRank, we propose to change the weights adaptively where the weights are calculated based on the current residual corresponding to the approximate PageRank vector. Numerical results show that the proposed Arnoldi method converges faster than existing methods, in particular when the damping factor is large. © 2011 John Wiley & Sons, Ltd. | - |
| dc.language | eng | - |
| dc.relation.ispartof | Numerical Linear Algebra with Applications | - |
| dc.subject | Weighted least squares problem | - |
| dc.subject | Arnoldi process | - |
| dc.subject | Eigenvalue and eigenvector | - |
| dc.subject | PageRank | - |
| dc.subject | Power method | - |
| dc.title | On adaptively accelerated Arnoldi method for computing PageRank | - |
| dc.type | Article | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1002/nla.789 | - |
| dc.identifier.scopus | eid_2-s2.0-84855210269 | - |
| dc.identifier.volume | 19 | - |
| dc.identifier.issue | 1 | - |
| dc.identifier.spage | 73 | - |
| dc.identifier.epage | 85 | - |
| dc.identifier.eissn | 1099-1506 | - |
| dc.identifier.isi | WOS:000298595300006 | - |
| dc.identifier.issnl | 1070-5325 | - |