Fast top-k similarity join for SimRank

DOI10.1016/J.INS.2016.10.042zbMATH Open1429.68196OpenAlexW2556944587MaRDI QIDQ2292935FDOQ2292935

Authors: Xiang Zhao, Haichuan Shang, Weidong Xiao, Ruiqi Li, Yifan Chen 

Publication date: 6 February 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2016.10.042

Recommendations

• A matrix sampling approach for efficient SimRank computation
• Efficient SimRank-based similarity join
• Fast, memory-efficient low-rank approximation of SimRank
• Speeding up SimRank computations by polynomial preconditioners
• Accuracy estimation of link-based similarity measures and its application

zbMATH Keywords

upper boundtop-\(k\)iterative pruningsimilarity join

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (7)

• Speeding up SimRank computations by polynomial preconditioners
• Fast, memory-efficient low-rank approximation of SimRank
• Bidirectional comparison of multi-attribute qualitative objects
• Efficient SimRank-based similarity join
• A matrix sampling approach for efficient SimRank computation
• HeteRank: a general similarity measure in heterogeneous information networks by integrating multi-type relationships
• An uncertain graph oriented SimRank algorithm

Uses Software

• SimRank

This page was built for publication: Fast top-\(k\) similarity join for SimRank

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