Random Walk with Restart on Large Graphs Using Block Elimination
ACM Transactions on Database Systems · 30.06.2016 · 41 (2) · 1-43
DOI: 10.1145/2901736 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Database Systems, online erschienen am 11.05.2016. Verfasst von Jinhong Jung und 3 weiteren Autor:innen. Die Arbeit wurde bisher 29-mal zitiert (Crossref) und nennt 50 Literaturangaben. Gefördert von: NRF, MSIP/IITP, MSIP.
Abstract (Originalsprache)
Given a large graph, how can we calculate the relevance between nodes fast and accurately? Random walk with restart (RWR) provides a good measure for this purpose and has been applied to diverse data mining applications including ranking, community detection, link prediction, and anomaly detection. Since calculating RWR from scratch takes a long time, various preprocessing methods, most of which are related to inverting adjacency matrices, have been proposed to speed up the calculation. However, these methods do not scale to large graphs because they usually produce large dense matrices that do not fit into memory. In addition, the existing methods are inappropriate when graphs dynamically change because the expensive preprocessing task needs to be computed repeatedly. In this article, we propose B ear , a fast, scalable, and accurate method for computing RWR on large graphs. B ear has two versions: a preprocessing method B ear S for static graphs and an incremental update method B ear D for dynamic graphs. B ear S consists of the preprocessing step and the query step. In the preprocessing step, B ear S reorders the adjacency matrix of a given graph so that it contains a large and easy-to-invert submatrix, and precomputes several matrices including the Schur complement of the submatrix. In the query step, B ear S quickly computes the RWR scores for a given query node using a block elimination approach with the matrices computed in the preprocessing step. For dynamic graphs, B ear D efficiently updates the changed parts in the preprocessed matrices of B ear S based on the observation that only small parts of the preprocessed matrices change when few edges are inserted or deleted. Through extensive experiments, we show that B ear S significantly outperforms other state-of-the-art methods in terms of preprocessing and query speed, space efficiency, and accuracy. We also show that B ear D quickly updates the preprocessed matrices and immediately computes queries when the graph changes.
Förderung
- NRF
- MSIP/IITP
- MSIP
Zitieren
APA
Jung, J., Shin, K., Sael, L., & Kang, U. (2016). Random Walk with Restart on Large Graphs Using Block Elimination. ACM Transactions on Database Systems, 41(2), 1-43. https://doi.org/10.1145/2901736
Vancouver
Jung J, Shin K, Sael L, Kang U. Random Walk with Restart on Large Graphs Using Block Elimination. ACM Transactions on Database Systems. 2016;41(2):1-43. doi:10.1145/2901736
BibTeX
@article{Jung2016,
author = {Jung, Jinhong and Shin, Kijung and Sael, Lee and Kang, U},
title = {Random Walk with Restart on Large Graphs Using Block Elimination},
journal = {ACM Transactions on Database Systems},
year = {2016},
volume = {41},
number = {2},
pages = {1--43},
doi = {10.1145/2901736}
}
EUVIMED