@article{oai:ipsj.ixsq.nii.ac.jp:00074651,
 author = {藤原, 靖宏 and 中辻, 真 and 鬼塚, 真 and 喜連川, 優 and Yasuhiro, Fujiwara and Makoto, Nakatsuji and Makoto, Onizuka and Masaru, Kitsuregawa},
 issue = {2},
 journal = {情報処理学会論文誌データベース(TOD)},
 month = {Jul},
 note = {グラフは基本的なデータ構造であり,世の中の様々なシステムで用いられている.グラフのノード間の類似度として近年Random walk with restart(RWR)が提案され,様々なアプリケーションに応用されている.本論文ではグラフの中からRWRに基づいて問合せノードに対する類似ノードをK個高速かつ正確に検索する問題を対象とする.提案手法では(1)特定のノードの類似度を疎行列を用いて計算する方法と,(2)不必要な類似度の計算を探索において省略する方法を用いる.実データを用いて比較実験を行い,提案手法は従来手法より高速に類似ノードを検索できることを確認した., Graphs are a fundamental data structure and have been recently employed to model real-world systems and phenomena. Random walk with restart (RWR) provides a good similarity score between two nodes in a graph, and it has been successfully used in many applications. The goal of this work is to find nodes that have high similarities for a given node based on RWR. Our solution is based on two ideas: (1) We computes the similarity of a selected node by matrices, and (2) we skips similarity computations when searching nodes. We perform comprehensive experiments to verify the efficiency of our approach. The results show that our approach can find high similarity nodes with significantly better speed than the previous approaches.},
 pages = {25--34},
 title = {Random walk with restartに対する高速な検索手法},
 volume = {4},
 year = {2011}
}