{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00216505","sets":["1164:3616:10863:10864"]},"path":["10864"],"owner":"44499","recid":"216505","title":["Weisfeiler-Lehmanアルゴリズムに基づく新しいグラフ構造間距離の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-02-18"},"_buckets":{"deposit":"6aac25ff-c3b4-4bd9-8d17-45c5e4b8e51c"},"_deposit":{"id":"216505","pid":{"type":"depid","value":"216505","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Weisfeiler-Lehmanアルゴリズムに基づく新しいグラフ構造間距離の提案","author_link":["558900","558901","558902"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Weisfeiler-Lehmanアルゴリズムに基づく新しいグラフ構造間距離の提案"},{"subitem_title":"A novel graph distance based on Weisfeiler-Lehman algorithm","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-02-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学基幹理工学研究科情報理工・通信専攻"},{"subitem_text_value":"早稲田大学基幹理工学研究科情報理工・通信専攻"},{"subitem_text_value":"早稲田大学基幹理工学研究科情報理工・通信専攻／早稲田大学基幹理工学部情報通信学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science and Communications Engineering, FSE Graduate School, WASEDA University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Communications Engineering, FSE Graduate School, WASEDA University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Communications Engineering, FSE Graduate School, WASEDA University / Department of Computer Science and Communications Engineering, FSE Graduate School, WASEDA University","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/216505/files/IPSJ-AVM22116006.pdf","label":"IPSJ-AVM22116006.pdf"},"date":[{"dateType":"Available","dateValue":"2024-02-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AVM22116006.pdf","filesize":[{"value":"2.4 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"27"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"307a9aad-dc31-41a2-b12c-e69e63761ccc","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"方, 鐘熙"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"黄, 健明"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"笠井, 裕之"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10438399","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8582","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"有効なグラフ距離の定義は，距離の理論的妥当性，時間複雑性，及びグラフ間の距離としての有効性を考慮する必要があるため，グラフ機械学習における困難な課題である．本稿では，グラフカーネルでよく用いられる Weisfeiler-Lehman（WL）アルゴリズムの欠点に対処し，新しいグラフ構造間の距離を提案する．具体的には，まず WL アルゴリズムを構造解析の観点から分析し，カテゴリラベルの整合性のみに基づいてノードを識別することは，重要な構造情報を十分に捉えないことを論じる．そこで，カテゴリラベルを用いる代わりに，WL 部分木間のノード距離を木構造編集距離で定義し，複雑なグラフ構造を測定することを試みる．さらに，その計算のための効率的なアルゴリズムを提案する．最後に，提案したノード距離を応用し，最適輸送の枠組みを利用した埋め込み空間上のグラフ距離を定義する．要約すると，我々は 2 つのノード間の木構造編集距離を定義し，それをグラフレベルに反映させる．グラフ分類課題に対する数値実験の結果，提案するグラフ Wasserstein 距離は従来手法と同等以上の性能を持つことが示された．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告オーディオビジュアル複合情報処理（AVM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-02-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"2022-AVM-116"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":216505,"updated":"2025-01-19T15:50:01.091122+00:00","links":{},"created":"2025-01-19T01:17:04.904656+00:00"}