Practical acceleration for computing the HITS expertrank vectors (Q442725)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6063172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Practical acceleration for computing the HITS expertrank vectors |
scientific article; zbMATH DE number 6063172 |
Statements
Practical acceleration for computing the HITS expertrank vectors (English)
0 references
3 August 2012
0 references
The author aims at accelerating the computation of Hyperlink-Induced Topic Search (HITS), developed by Kleinberg in the 90s and used in the \texttt{ask.com} search engine. A practical acceleration scheme is proposed, exploiting a filtered power method by adaptive Chebyshev polynomials. Detailed algorithms are provided and carefully analysed. The proposed scheme appears efficient and can be extended for computing more principal eigenvectors, such as in truncated SVD calculations. Numerical examples enlighten the features of the presented method.
0 references
HITS
0 references
ranking
0 references
principal eigenvector
0 references
Chebyshev filter
0 references
filter bound
0 references
0 references
0 references
0 references
0.7960953116416931
0 references
0.7873215675354004
0 references
0.7781226634979248
0 references
0.7755561470985413
0 references
0.770057201385498
0 references
