Efficient and Exact Local Search for Random Walk Based Top-K Proximity Query in Large Graphs
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...
| Publié dans: | IEEE transactions on knowledge and data engineering. - 1998. - 28(2016), 5 vom: 06. Mai, Seite 1160-1174 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2016
|
| Accès à la collection: | IEEE transactions on knowledge and data engineering |
| Sujets: | Journal Article Local search nearest neighbors proximity search random walk top-k search |
| Accès en ligne |
Volltext |