Fast Ad-Hoc Search Algorithm for Personalized PageRank
-
- FUJIWARA Yasuhiro
- NTT Software Innovation Center
-
- NAKATSUJI Makoto
- NTT Resonant
-
- SHIOKAWA Hiroaki
- University of Tsukuba
-
- MISHIMA Takeshi
- NTT Software Innovation Center
-
- ONIZUKA Makoto
- Osaka University
この論文をさがす
抄録
<p>Personalized PageRank (PPR) is a typical similarity metric between nodes in a graph, and node searches based on PPR are widely used. In many applications, graphs change dynamically, and in such cases, it is desirable to perform ad hoc searches based on PPR. An ad hoc search involves performing searches by varying the search parameters or graphs. However, as the size of a graph increases, the computation cost of performing an ad hoc search can become excessive. In this paper, we propose a method called Castanet that offers fast ad hoc searches of PPR. The proposed method features (1) iterative estimation of the upper and lower bounds of PPR scores, and (2) dynamic pruning of nodes that are not needed to obtain a search result. Experiments confirm that the proposed method does offer faster ad hoc PPR searches than existing methods.</p>
収録刊行物
-
- IEICE Transactions on Information and Systems
-
IEICE Transactions on Information and Systems E100.D (4), 610-620, 2017
一般社団法人 電子情報通信学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679355636352
-
- NII論文ID
- 130005529913
-
- NII書誌ID
- AA10826272
-
- ISSN
- 17451361
- 09168532
-
- HANDLE
- 2241/00146196
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- IRDB
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可