Fast random walk with restart and its applications

H Tong, C Faloutsos, JY Pan - Sixth international conference on …, 2006 - ieeexplore.ieee.org
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …
被引用次数：1406 相关文章

Fast Random Walk with Restart and Its Applications

H Tong, C Faloutsos, JY Pan - … Conference on Data Mining (ICDM'06), 2006 - computer.org
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …
[PDF] uh.edu

[PDF][PDF] Fast Random Walk with Restart and Its Applications

H Tong, C Faloutsos, JY Pan - cs.uh.edu
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …

[引用][C] Fast Random Walk with Restart and Its Applications

H Tong, C Faloutsos, J Pan - … Conference on Data Mining (ICDM'06), 2006 - cir.nii.ac.jp
Fast Random Walk with Restart and Its Applications | CiNii Research CiNii 国立情報学研究所
学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学 …
[PDF] psu.edu

[PDF][PDF] Fast Random Walk with Restart and Its Applications

H Tong, C Faloutsos, JY Pan - Citeseer
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …
[PDF] iitb.ac.in

[PDF][PDF] Fast Random Walk with Restart and Its Applications

H Tong, C Faloutsos, JY Pan - cse.iitb.ac.in
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …

Fast Random Walk with Restart and Its Applications

H Tong, C Faloutsos, JY Pan - Sixth International Conference on Data Mining … - infona.pl
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …
[PDF] cuhk.edu.hk

[PDF][PDF] Fast Random Walk with Restart and Its Applications

H Tong, C Faloutsos, JY Pan - se.cuhk.edu.hk
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …
[PDF] cmu.edu

[PDF][PDF] Fast Random Walk with Restart and Its Applications

H Tong, C Faloutsos, JY Pan - cs.cmu.edu
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …
[PDF] archive.org

[PDF][PDF] Fast Random Walk with Restart and Its Applications

H Tong, C Faloutsos, JY Pan - scholar.archive.org
How closely related are two nodes in a graph? How to compute this score quickly, on huge,
disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance …