Random walk with restart over dynamic graphs

W Yu, J McCann - 2016 ieee 16th international conference on …, 2016 - ieeexplore.ieee.org
… Recently, Random Walk with Restart (RWR) [11] has been proposed as an attractive …
ascribed to its intuitive concept that revolves around random walks. Consider a random surfer …

Fast and accurate random walk with restart on dynamic graphs with guarantees

M Yoon, W Jin, U Kang - Proceedings of the 2018 World Wide Web …, 2018 - dl.acm.org
… a fast and accurate way, with theoretical guarantees on the convergence and the error?
Random Walk with Restart (… and has been exploited in numerous applications. Many real-world …

Random walk with restart on large graphs using block elimination

J Jung, K Shin, L Sael, U Kang - ACM Transactions on Database …, 2016 - dl.acm.org
… We also discuss how our method can be applied to other random walk–based measures,
such as personalized PageRank [Page et al. 1999]; effective importance (EI) [Bogdanov and …

Random walks: A review of algorithms and applications

F Xia, J Liu, H Nie, Y Fu, L Wan… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
… the knowledge of classical random walks and quantum walks, including … walks and classical
random walks from the perspective of time complexity. Then we introduce their applications

Index-free approach with theoretical guarantee for efficient random walk with restart query

D Lin, RCW Wong, M Xie, VJ Wei - 2020 IEEE 36th …, 2020 - ieeexplore.ieee.org
… on graph data is Random Walk with Restart (RWR) since it provides a good metric for
measuring the proximity of two nodes in a graph. Although RWR is important, it is challenging to …

Random walk with restart on hypergraphs: fast computation and an application to anomaly detection

J Chun, G Lee, K Shin, J Jung - Data Mining and Knowledge Discovery, 2024 - Springer
… probability distribution of random walk when we assume a random surfer who restarts at a
query node … and related studies on random walks on (hyper-)graphs and their applications. …

Tpa: Fast, scalable, and accurate method for approximate random walk with restart on billion scale graphs

M Yoon, J Jung, U Kang - 2018 IEEE 34th International …, 2018 - ieeexplore.ieee.org
… time and memory considering the amount of their sacrificed accuracy. In this paper, we
propose TPA (Two Phase Approximation for random walk with restart), a fast, scalable, and highly …

Optimized Random Walk with Restart for Recommendation Systems

SM Rahimi, RA de Oliveira e Silva, B Far… - Canadian Conference on …, 2019 - Springer
… For future studies, we will focus on the application of the ORWR on other … the application
of proposed model to fast random walk with restart techniques to provide an even faster ORWR …

A comparative study of matrix factorization and random walk with restart in recommender systems

H Park, J Jung, U Kang - … Conference on Big Data (Big Data), 2017 - ieeexplore.ieee.org
… in matrix factorization has its corresponding one in random walk with restart. This lays the …
We newly devise a random walk with restart method that introduces global bias terms. It

Supervised and extended restart in random walks for ranking and link prediction in networks

W Jin, J Jung, U Kang - PloS one, 2019 - journals.plos.org
… In this section, we describe the preliminaries on Random Walk with Restart. Then, we
formally define the problem handled in this paper. We use A ij or A(i, j) to denote the entry at the …