Speeding up SimRank computations by polynomial preconditioners

DOI10.1016/J.APNUM.2020.02.009zbMATH Open1436.65028OpenAlexW3005858266MaRDI QIDQ1986147FDOQ1986147

Juan Lu, Zhiguo Gong, Sio Wan Ng, Siu-Long Lei

Publication date: 7 April 2020

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2020.02.009

Recommendations

• A matrix sampling approach for efficient SimRank computation
• Fast, memory-efficient low-rank approximation of SimRank
• Fast top-\(k\) similarity join for SimRank
• A preconditioning approach to the pagerank computation problem
• On accelerating the PageRank computation

zbMATH Keywords

graphmatrixlinear systempolynomial preconditionerSimRank

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Cites Work

• Title not available (Why is that?)
• Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem

Uses Software

• SimRank

This page was built for publication: Speeding up SimRank computations by polynomial preconditioners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1986147)