{"id":74651,"updated":"2025-01-20T06:25:46.217780+00:00","links":{},"created":"2025-01-18T23:32:06.686381+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00074651","sets":["934:1022:6385:6456"]},"path":["6456"],"owner":"11","recid":"74651","title":["Random walk with restartに対する高速な検索手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-07-01"},"_buckets":{"deposit":"5a6ed32f-8026-4da0-92cc-4ad7e000fff3"},"_deposit":{"id":"74651","pid":{"type":"depid","value":"74651","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Random walk with restartに対する高速な検索手法","author_link":["363063","363065","363061","363067","363062","363066","363064","363060"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Random walk with restartに対する高速な検索手法"},{"subitem_title":"Efficient Search Method for Random Walk with Restart","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"研究論文（優秀論文賞受賞）","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2011-07-01","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"日本電信電話株式会社NTTサイバースペース研究所／東京大学生産技術研究所"},{"subitem_text_value":"日本電信電話株式会社NTTサイバーソリューション研究所"},{"subitem_text_value":"日本電信電話株式会社NTTサイバースペース研究所"},{"subitem_text_value":"東京大学生産技術研究所"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Cyber Space Laboratories, NTT Corporation / Institute of Industrial Science, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"NTT Cyber Solution Laboratories, NTT Corporation","subitem_text_language":"en"},{"subitem_text_value":"NTT Cyber Space Laboratories, NTT Corporation","subitem_text_language":"en"},{"subitem_text_value":"Institute of Industrial Science, The University of Tokyo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/74651/files/IPSJ-TOD0402004.pdf","label":"IPSJ-TOD0402004"},"date":[{"dateType":"Available","dateValue":"2013-07-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOD0402004.pdf","filesize":[{"value":"547.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"13"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"7196f805-85cd-45ef-bbd4-5674c4db917a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤原, 靖宏"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"中辻, 真"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鬼塚, 真"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"喜連川, 優"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasuhiro, Fujiwara","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Makoto, Nakatsuji","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Makoto, Onizuka","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masaru, Kitsuregawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464847","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7799","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"グラフは基本的なデータ構造であり，世の中の様々なシステムで用いられている．グラフのノード間の類似度として近年Random walk with restart（RWR）が提案され，様々なアプリケーションに応用されている．本論文ではグラフの中からRWRに基づいて問合せノードに対する類似ノードをK個高速かつ正確に検索する問題を対象とする．提案手法では(1)特定のノードの類似度を疎行列を用いて計算する方法と，(2)不必要な類似度の計算を探索において省略する方法を用いる．実データを用いて比較実験を行い，提案手法は従来手法より高速に類似ノードを検索できることを確認した．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"34","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌データベース（TOD）"}],"bibliographicPageStart":"25","bibliographicIssueDates":{"bibliographicIssueDate":"2011-07-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"4"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}