An algebraic multigrid solution of large hierarchical markovian models arising in web information retrieval

Authors:
Udo R. Krieger
Affiliations:
Faculty Information Systems and Applied Computer Science, Otto-Friedrich University, Bamberg, Germany
Venue:
Network performance engineering
Year:
2011

Citing 12
Cited 0

An iterative aggregation-disaggregation algorithm for solving linear equations

Applied Mathematics and Computation
Aggregation/disaggregation methods for computing the stationary distribution of a Markov chain

SIAM Journal on Numerical Analysis
Constructive interference in parallel algorithms

SIAM Journal on Numerical Analysis
A multi-level solution algorithm for steady-state Markov chains

SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains

Journal of the ACM (JACM)
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
SALSA: the stochastic approach for link-structure analysis

ACM Transactions on Information Systems (TOIS)
Stable algorithms for link analysis

Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Google's PageRank and Beyond: The Science of Search Engine Rankings

Google's PageRank and Beyond: The Science of Search Engine Rankings
On the universality of rank distributions of website popularity

Computer Networks: The International Journal of Computer and Telecommunications Networking
Web search clickstreams

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Improving Link Analysis through Considering Hosts and Blocks

WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In Web information retrieval stochastic link analysis provides important supplementary means to generate a ranking of searched objects. Considering a hierarchical algebraic description of a Web graph with host-oriented clustering of pages or a role-oriented perspective, we propose an efficient computation of the stationary distribution of the underlying homogeneous Markov chain of a random surfer by iterative aggregation/disaggregation procedures and algebraic multigrid methods. In particular, we discuss the application of an efficient multigrid variant of the multiplicative Schwarz iteration which can be performed on a single machine with limited storage requirements.