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

Efficient and Exact Local Search for Random Walk Based Top-K Proximity Query in Large Graphs DOWNLOAD PROJECT SYNOPSIS 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. An efficient and exact local search method is developed, FLoS (Fast Local Search), for top- k proximity query in large graphs. FLoS guarantees the exactness…

Read More