Efficient and Exact Local Search for Random Walk Based Top-K Proximity Query in Large Graphs

Yubao Wu, Ruoming Jin, Xiang Zhang

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Top-k proximity query in large graphs is a fundamental problem with a wide range of applications. Various random walk based measures have been proposed to measure the proximity between different nodes. Although these measures are effective, efficiently computing them on large graphs is a challenging task. In this paper, we develop an efficient and exact local search method, FLoS (Fast Local Search), for top-k proximity query in large graphs. FLoS guarantees the exactness of the solution. Moreover, it can be applied to a variety of commonly used proximity measures. FLoS is based on the no local optimum property of proximity measures. We show that many measures have no local optimum. Utilizing this property, we introduce several operations to manipulate transition probabilities and develop tight lower and upper bounds on the proximity values. The lower and upper bounds monotonically converge to the exact proximity value when more nodes are visited. We further extend FLoS to measures having local optimum by utilizing relationship among different measures. We perform comprehensive experiments on real and synthetic large graphs to evaluate the efficiency and effectiveness of the proposed method.

Original languageEnglish (US)
Article number7374732
Pages (from-to)1160-1174
Number of pages15
JournalIEEE Transactions on Knowledge and Data Engineering
Volume28
Issue number5
DOIs
StatePublished - May 1 2016

Fingerprint

Experiments

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

@article{2fce8882117b4d1685f82685bec6ffaf,
title = "Efficient and Exact Local Search for Random Walk Based Top-K Proximity Query in Large Graphs",
abstract = "Top-k proximity query in large graphs is a fundamental problem with a wide range of applications. Various random walk based measures have been proposed to measure the proximity between different nodes. Although these measures are effective, efficiently computing them on large graphs is a challenging task. In this paper, we develop an efficient and exact local search method, FLoS (Fast Local Search), for top-k proximity query in large graphs. FLoS guarantees the exactness of the solution. Moreover, it can be applied to a variety of commonly used proximity measures. FLoS is based on the no local optimum property of proximity measures. We show that many measures have no local optimum. Utilizing this property, we introduce several operations to manipulate transition probabilities and develop tight lower and upper bounds on the proximity values. The lower and upper bounds monotonically converge to the exact proximity value when more nodes are visited. We further extend FLoS to measures having local optimum by utilizing relationship among different measures. We perform comprehensive experiments on real and synthetic large graphs to evaluate the efficiency and effectiveness of the proposed method.",
author = "Yubao Wu and Ruoming Jin and Xiang Zhang",
year = "2016",
month = "5",
day = "1",
doi = "10.1109/TKDE.2016.2515579",
language = "English (US)",
volume = "28",
pages = "1160--1174",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "5",

}

Efficient and Exact Local Search for Random Walk Based Top-K Proximity Query in Large Graphs. / Wu, Yubao; Jin, Ruoming; Zhang, Xiang.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 28, No. 5, 7374732, 01.05.2016, p. 1160-1174.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient and Exact Local Search for Random Walk Based Top-K Proximity Query in Large Graphs

AU - Wu, Yubao

AU - Jin, Ruoming

AU - Zhang, Xiang

PY - 2016/5/1

Y1 - 2016/5/1

N2 - Top-k proximity query in large graphs is a fundamental problem with a wide range of applications. Various random walk based measures have been proposed to measure the proximity between different nodes. Although these measures are effective, efficiently computing them on large graphs is a challenging task. In this paper, we develop an efficient and exact local search method, FLoS (Fast Local Search), for top-k proximity query in large graphs. FLoS guarantees the exactness of the solution. Moreover, it can be applied to a variety of commonly used proximity measures. FLoS is based on the no local optimum property of proximity measures. We show that many measures have no local optimum. Utilizing this property, we introduce several operations to manipulate transition probabilities and develop tight lower and upper bounds on the proximity values. The lower and upper bounds monotonically converge to the exact proximity value when more nodes are visited. We further extend FLoS to measures having local optimum by utilizing relationship among different measures. We perform comprehensive experiments on real and synthetic large graphs to evaluate the efficiency and effectiveness of the proposed method.

AB - Top-k proximity query in large graphs is a fundamental problem with a wide range of applications. Various random walk based measures have been proposed to measure the proximity between different nodes. Although these measures are effective, efficiently computing them on large graphs is a challenging task. In this paper, we develop an efficient and exact local search method, FLoS (Fast Local Search), for top-k proximity query in large graphs. FLoS guarantees the exactness of the solution. Moreover, it can be applied to a variety of commonly used proximity measures. FLoS is based on the no local optimum property of proximity measures. We show that many measures have no local optimum. Utilizing this property, we introduce several operations to manipulate transition probabilities and develop tight lower and upper bounds on the proximity values. The lower and upper bounds monotonically converge to the exact proximity value when more nodes are visited. We further extend FLoS to measures having local optimum by utilizing relationship among different measures. We perform comprehensive experiments on real and synthetic large graphs to evaluate the efficiency and effectiveness of the proposed method.

UR - http://www.scopus.com/inward/record.url?scp=84963865393&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84963865393&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2016.2515579

DO - 10.1109/TKDE.2016.2515579

M3 - Article

AN - SCOPUS:84963865393

VL - 28

SP - 1160

EP - 1174

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 5

M1 - 7374732

ER -