Fast, memory-efficient low-rank approximation of SimRank

@article{Oseledets2017FastML,
  title={Fast, memory-efficient low-rank approximation of SimRank},
  author={I. Oseledets and G. V. Ovchinnikov and Alexandr Katrutsa},
  journal={ArXiv},
  year={2017},
  volume={abs/1410.0717}
}
SimRank is a well-known similarity measure between graph vertices. In this paper novel low-rank approximation of SimRank is proposed. 

Figures from this paper

Efficient SimRank Tracking in Dynamic Graphs
TLDR
This paper proposes a novel local push based algorithm for computing all-pairs SimRank and shows that its algorithms outperform the state-of-the-art static and dynamic all-Pair SimRank algorithms.
Tensor SimRank for Heterogeneous Information Networks
TLDR
A generalization of SimRank similarity measure for heterogeneous information networks is proposed and it is shown that the intraclass similarity score s(a, b) is high if the set of objects that are related with a are pair-wise similar according to all imposed relations.

References

SHOWING 1-10 OF 23 REFERENCES
Efficient Partial-Pairs SimRank Search for Large Networks
TLDR
A novel "seed germination" model that computes partial-pairs SimRank in O(k|E| min{|A|, |B|}) time and O(|E | + k|V|) memory for k iterations on a graph of |V| nodes and |E| edges, allowing scores to be assessed accurately on graphs with tens of millions of links.
Scalable similarity search for SimRank
TLDR
This paper proposes a very fast and scalable SimRank-based similarity search problem, and establishes a Monte-Carlo based algorithm to compute a single pair SimRank score s(u,v), which is based on the random-walk interpretation of the linear recursive formula.
Efficient Algorithm for Computing Link-Based Similarity in Real World Networks
TLDR
This paper proposes a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure, and proves the convergence of the proposed algorithm.
ASCOS: An Asymmetric network Structure COntext Similarity measure
  • Hung-Hsuan Chen, C. Lee Giles
  • Computer Science
    2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)
  • 2013
TLDR
It is shown that ASCOS outputs a more complete similarity score than SimRank because SimRank (and several of its variations, such as P-Rank and SimFusion) on average ignores half paths between nodes during calculation.
MapReduce-Based SimRank Computation and Its Application in Social Recommender System
TLDR
This paper proposes parallel algorithms for SimRank computation on Map-Reduce framework, and more specifically its open source implementation, Hadoop, and employs the proposed methods to do the similarity computation in order to recommend appropriate products to users in social recommender systems.
Efficient search algorithm for SimRank
TLDR
The solution, SimMat, is based on two ideas: It computes the approximate similarity of a selected node pair efficiently in non-iterative style based on the Sylvester equation, and it prunes unnecessary approximate similarity computations when searching for the high similarity nodes by exploiting estimationsbased on the Cauchy-Schwarz inequality.
Sig-SR: SimRank search over singular graphs
TLDR
An efficient algorithm over singular graphs, InvSR, is proposed for calculating all-pairs SimRank in O(r(n2+Kr2) time for K iterations, and the experimental results on real and synthetic datasets demonstrate the superiority of InvSR on singular graphs against its baselines.
On Top-k Structural Similarity Search
TLDR
An algorithmic framework called TopSim is proposed based on transforming the top-k SimRank problem on a graph G to one of finding thetop-k nodes with highest authority on the product graph G G, which further accelerate Top Sim by merging similarity paths and develop a more efficient algorithm called Top Sim-SM.
Fast computation of SimRank for static and dynamic information networks
TLDR
A family of novel approximate SimRank computation algorithms for static and dynamic information networks are developed and their corresponding theoretical justification and analysis are given.
...
...